{"$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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"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":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"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":"SqlToRel::sql_statement_to_plan_with_context_impl (cyclomatic 214): SqlToRel::sql_statement_to_plan_with_context_impl has cyclomatic complexity 214 (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":"datafusion/sql/src/statement.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"075e1f965fa63090da7273250a14a1fb9be2fd2ec1c665bd1940672aae13a371"}},{"ruleId":"D1","level":"warning","message":{"text":"Simplifier::f_up (cyclomatic 180): Simplifier::f_up has cyclomatic complexity 180 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever 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":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b61df1998ec952fe4f6d53339f984ae15137a2ede1bc589252a810033329b4"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarValue::deserialize (cyclomatic 136): ScalarValue::deserialize has cyclomatic complexity 136 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":8916}}}],"partialFingerprints":{"codehealthFindingId/v1":"9286083c56b7060019dd2fa9fd9960e8e6c4887eb771c75561a1adb6d41a2577"}},{"ruleId":"D1","level":"warning","message":{"text":"Unparser::select_to_sql_recursively (cyclomatic 125): Unparser::select_to_sql_recursively has cyclomatic complexity 125 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ee381c97f5fc18c99b83fec5dabe3c7248864f6673d770605c53a730fe654d"}},{"ruleId":"D1","level":"warning","message":{"text":"ParquetOptions::deserialize (cyclomatic 121): ParquetOptions::deserialize has cyclomatic complexity 121 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":6796}}}],"partialFingerprints":{"codehealthFindingId/v1":"7653ae5024691cbb9c6fc29e9119212dbc84976e83afe61c9a6a25096478d439"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultPhysicalPlanner::map_logical_node_to_physical (cyclomatic 115): DefaultPhysicalPlanner::map_logical_node_to_physical has cyclomatic complexity 115 (threshold 15). Of this number, 111 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"544d45c7b5a0db9ec7478ec8acd35ebdca0ea0ee1a58bc21fafbee580a4973c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarValue::eq (cyclomatic 112): ScalarValue::eq 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7ec76faf2e5fcf73d6d44d874e48463ba48635d081b4a991b7e8affb547aeb"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarValue::partial_cmp (cyclomatic 110): ScalarValue::partial_cmp has cyclomatic complexity 110 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d8467967bb8cdb237f594b41d253d6f7146c3e9db01a701ba0dfe4e902cb30"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_substrait::logical_plan::consumer::expr::literal::from_substrait_literal (cyclomatic 96): datafusion_substrait::logical_plan::consumer::expr::literal::from_substrait_literal has cyclomatic complexity 96 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever 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":"datafusion/substrait/src/logical_plan/consumer/expr/literal.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f480d1f6f5eefef57c34131d416fbad3492a04dcea8b31e3bdca7b208f2d87"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarValue::iter_to_array (cyclomatic 87): ScalarValue::iter_to_array has cyclomatic complexity 87 (threshold 15). Of this number, 82 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fba64638c309b08ecc2d37de18efd28b0bc1d204f42d16da8d39ed094ed31a"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarValue::to_array_of_size (cyclomatic 87): ScalarValue::to_array_of_size has cyclomatic complexity 87 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":3745}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0028056b396d79d3b0fca8bc2d7e87c19262b22c8500c2ca18ad0607f741c0"}},{"ruleId":"D1","level":"warning","message":{"text":"ParquetOptions::serialize (cyclomatic 81): ParquetOptions::serialize has cyclomatic complexity 81 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":6464}}}],"partialFingerprints":{"codehealthFindingId/v1":"69eeaa988e2ad52fd0619d0bcf758dc23c39ebad99b35184939264e6af98eee1"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlToRel::sql_function_to_expr (cyclomatic 77): SqlToRel::sql_function_to_expr has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3204b056ec39256c26e4c3105d25cc5554822daa6df06dd645d68742ab30b5"}},{"ruleId":"D1","level":"warning","message":{"text":"PushDownFilter::rewrite (cyclomatic 73): PushDownFilter::rewrite has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c84e5bc3c33814ebbf019e0687d2a7bab239412734ad81907316617c30d8930"}},{"ruleId":"D1","level":"warning","message":{"text":"CsvOptions::deserialize (cyclomatic 70): CsvOptions::deserialize has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3238781f295ebef23c48975f31d34708cb5397a06f0f24dba2c9afda19bb18"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarValue::eq_array (cyclomatic 66): ScalarValue::eq_array has cyclomatic complexity 66 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":4832}}}],"partialFingerprints":{"codehealthFindingId/v1":"882a925812277ef965ea346226fb8f0ab5047d31ce755bb4cfd9d2cd6423735f"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_expr::type_coercion::functions::get_valid_types (cyclomatic 66): datafusion_expr::type_coercion::functions::get_valid_types has cyclomatic complexity 66 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 28 belong to 8 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":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4de7b98e136e97af173cabfaea75bcc73d135263cbfd78821eac17803bd24f"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_substrait::logical_plan::consumer::types::from_substrait_type (cyclomatic 66): datafusion_substrait::logical_plan::consumer::types::from_substrait_type has cyclomatic complexity 66 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/types.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8e23cbfe4a0fac57b66e69daac76395c9f009b5ea0a3f1107ff4992932e09b"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarValue::try_from_array (cyclomatic 65): ScalarValue::try_from_array 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":4333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f108ed4a41b018aa079a02274b13ed13083344eb467bda691d402b6f8f8482b"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalPlan::display (cyclomatic 65): LogicalPlan::display 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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":2173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f8f3b88c0c5606b35f2b1a4a06b2d387172b97ff839f94bc68c847508c55f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarValue::try_from (cyclomatic 64): ScalarValue::try_from has cyclomatic complexity 64 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/to_proto/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"44da7c2a52551aaa70a204dc9ada12ab1343832ff32e7e1f5044c61202ac6a1e"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_expr_common::casts::try_cast_numeric_literal (cyclomatic 64): datafusion_expr_common::casts::try_cast_numeric_literal has cyclomatic complexity 64 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/casts.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"460431bc28f4eeff3c5ab7cec67fb8275749628dfb9a021037edd0bf1be64816"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlToRel::sql_expr_to_logical_expr_internal (cyclomatic 64): SqlToRel::sql_expr_to_logical_expr_internal has cyclomatic complexity 64 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d3be539984525592facedbdab99b14961c6553ec9ea9cfbcff2af90189e6cc"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::fmt (cyclomatic 60): Expr::fmt has cyclomatic complexity 60 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever 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":"datafusion/expr/src/expr.rs"},"region":{"startLine":3620}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f36b12b483edd2cfb0f9b6be03e4a391fdb21a1f72023346b983fb798948b0"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarValue::try_from (cyclomatic 57): ScalarValue::try_from has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever 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":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"78aed58ec8424f29f9aca0d991f39ff18ec82f3836f6f29511034eb9cc9b227d"}},{"ruleId":"D1","level":"warning","message":{"text":"PgJsonVisitor::to_json_value (cyclomatic 57): PgJsonVisitor::to_json_value has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever 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":"datafusion/expr/src/logical_plan/display.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d975441fbfe6d2afa5ba0b4862b0a57a6e31344b6afe801992a48b56b4b71fa9"}},{"ruleId":"D1","level":"warning","message":{"text":"Unparser::expr_to_sql_inner (cyclomatic 57): Unparser::expr_to_sql_inner has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever 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: Unparser::scalar_to_sql (cyclomatic 82) 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":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8310f978ce66afa5de220d7a55699244bc5ea90a76b3ead78a4632395f39641"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaDisplay::fmt (cyclomatic 55): SchemaDisplay::fmt has cyclomatic complexity 55 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever 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":"datafusion/expr/src/expr.rs"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff508941b2a55386902326635b5e81d8c197bb3c602adef525d078978134c06"}},{"ruleId":"D1","level":"warning","message":{"text":"PullUpCorrelatedExpr::f_up (cyclomatic 55): PullUpCorrelatedExpr::f_up 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":"datafusion/optimizer/src/decorrelate.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"850e835fc61d84832c6c0bf968a1e87eec38b2e5fe53f1cf3a96aa3fab55497c"}},{"ruleId":"D1","level":"warning","message":{"text":"CsvWriterOptions::deserialize (cyclomatic 52): CsvWriterOptions::deserialize has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd5bbbea80c8491d52e65125c6804240eb1b03589c228bafae2a4001030802b"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarValue::fmt (cyclomatic 52): ScalarValue::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. This is NOT this file\u0027s highest cyclomatic complexity: ScalarValue::fmt (cyclomatic 59) 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":5858}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e0b4e3ddeeebd3eadfef1f9c80bcf491b744ff9987d163f6199bdec4bd419a"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::normalize_eq (cyclomatic 50): Expr::normalize_eq 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":"datafusion/expr/src/expr.rs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"532878dec2068be0ac8750bba7c8e6dde6c3d173411355c20cd60a1729456412"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_expr::planner::create_physical_expr (cyclomatic 48): datafusion_physical_expr::planner::create_physical_expr 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":"datafusion/physical-expr/src/planner.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"63addaa2ece6c046a4934a90ae98ec2c6a7571a4a154158e3237edf83446136b"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_proto::logical_plan::from_proto::parse_expr (cyclomatic 48): datafusion_proto::logical_plan::from_proto::parse_expr 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":"datafusion/proto/src/logical_plan/from_proto.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"243bb6d74c28293e300bdb93d651c145cce92c313d9ec4dcad668705d3ed0089"}},{"ruleId":"D1","level":"warning","message":{"text":"CsvOptions::serialize (cyclomatic 47): CsvOptions::serialize has cyclomatic complexity 47 (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":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0200a9c181bbf82d5b7a2889b241e81948e80fd29304866b165559cad4d8333"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_optimizer::decorrelate_predicate_subquery::build_join (cyclomatic 46): datafusion_optimizer::decorrelate_predicate_subquery::build_join has cyclomatic complexity 46 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate_predicate_subquery.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a56f719e369eb92701d1620739981130fbf8f6a1545e7f0b9b46a5f9f8448c"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_proto::logical_plan::to_proto::serialize_expr (cyclomatic 45): datafusion_proto::logical_plan::to_proto::serialize_expr has cyclomatic complexity 45 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/to_proto.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a59b58ddb33a6b5aabcce561292651971c1de9b6a02735b188d0fc933cc023"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_substrait::logical_plan::producer::expr::literal::to_substrait_literal (cyclomatic 45): datafusion_substrait::logical_plan::producer::expr::literal::to_substrait_literal has cyclomatic complexity 45 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/producer/expr/literal.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb05c6ed002d6fb72cb3c6f024c1518ace06439910517ea13d0c04c74693e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalPlan::with_new_exprs (cyclomatic 42): LogicalPlan::with_new_exprs 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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"700dca286188dc8392926faa58d7b4642c2bb475f9265433d5747521f0462329"}},{"ruleId":"D1","level":"warning","message":{"text":"PlanType::deserialize (cyclomatic 40): PlanType::deserialize has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-models/src/generated/pbjson.rs"},"region":{"startLine":24813}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee474878ca634d53dd267addc7578ef19b706f409dd88d72e5008de92e5f818"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_datasource::write::demux::compute_partition_keys_by_row (cyclomatic 40): datafusion_datasource::write::demux::compute_partition_keys_by_row has cyclomatic complexity 40 (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":"datafusion/datasource/src/write/demux.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d983d0ad4f74a0782836ab1e638a1b85929f74e86fda562e028f15cec5a608"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::nullable (cyclomatic 40): Expr::nullable 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":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f280fc72050f16d44203152dcbd5a0c98b82fbe0997b89f5e8cc08fe2826e29"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_substrait::logical_plan::producer::types::to_substrait_type_from_field (cyclomatic 40): datafusion_substrait::logical_plan::producer::types::to_substrait_type_from_field 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":"datafusion/substrait/src/logical_plan/producer/types.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0005978e9e95b87e66242de462d709e0f27b2a1b27cb594cf4eb98dd661bb3a2"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_functions_nested::string::compute_array_to_string (cyclomatic 38): datafusion_functions_nested::string::compute_array_to_string 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":"datafusion/functions-nested/src/string.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fedc5944b9404060c92afda0cbdbf8040cc4724e904c225c139222d1fd7951"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCoercionRewriter::f_up (cyclomatic 38): TypeCoercionRewriter::f_up 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":"datafusion/optimizer/src/analyzer/type_coercion.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2a370551e8195ac48cf115f49947fc5004248a47cfe8c22c478bcfb946fdd8"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_functions::datetime::date_bin::date_bin_impl (cyclomatic 37): datafusion_functions::datetime::date_bin::date_bin_impl 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":"datafusion/functions/src/datetime/date_bin.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"b053edeba50cd33cbe0ccffe736fae15a86b699d85d23312987a71ad9ce48819"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlToRel::convert_simple_data_type (cyclomatic 37): SqlToRel::convert_simple_data_type 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":"datafusion/sql/src/planner.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecd50cf957f59dc153d8cc145a89cbceedb8decdc8df95a80d565c416b7f86e"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_plan::joins::utils::compare_join_arrays (cyclomatic 36): datafusion_physical_plan::joins::utils::compare_join_arrays 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":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fd0eada0daa8471edb5db56f05051192afb294c38104d67f80efb75b9b6a9d"}},{"ruleId":"D1","level":"warning","message":{"text":"CsvWriterOptions::serialize (cyclomatic 35): CsvWriterOptions::serialize has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: ScalarValue::serialize (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":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbed31cf255c20ad378955bb9eb9fb9eb7cbe5eb6c983ce02a9d3562e103913"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeType::fmt (cyclomatic 35): NativeType::fmt 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. This is NOT this file\u0027s highest cyclomatic complexity: NativeType::default_cast_for (cyclomatic 52) 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":"datafusion/common/src/types/native.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6ec3e6edfbe4d6f2b74faae9bd4cc7545995f938f04783aa3127603dbedbc6"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlDisplay::fmt (cyclomatic 35): SqlDisplay::fmt 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. This is NOT this file\u0027s highest cyclomatic complexity: Expr::variant_name (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":"datafusion/expr/src/expr.rs"},"region":{"startLine":3364}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b38905ca551e6217f25f88a26b3c668e6e0893d521716532bc72b6ced16cb93"}},{"ruleId":"D1","level":"warning","message":{"text":"ConcatWsFunc::invoke_with_args (cyclomatic 35): ConcatWsFunc::invoke_with_args 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":"datafusion/functions/src/string/concat_ws.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"916e6218cd494b0e2baf34c223454b726c1f72dcd05fef52650a03ddc45e3df8"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_plan::windows::window_equivalence_properties (cyclomatic 35): datafusion_physical_plan::windows::window_equivalence_properties 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":"datafusion/physical-plan/src/windows/mod.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fe87f75ca4d81a19121cbb5d4c62105b7856cfeaf03261b1b2d2e3f4d8ed98"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_pruning::pruning_predicate::build_predicate_expression (cyclomatic 35): datafusion_pruning::pruning_predicate::build_predicate_expression 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":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdc16f98baa615a126adb8cdddf59374875357a052c035fb618347744994793"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_distribution::ensure_distribution_with_stats (cyclomatic 34): datafusion_physical_optimizer::ensure_requirements::enforce_distribution::ensure_distribution_with_stats 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"3084dc5b29ea5746de2ef640f15d9563209bd0ae89f03955026570e44ce790f1"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlToRel::select_to_plan (cyclomatic 34): SqlToRel::select_to_plan has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/select.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8154092bba1b63c13f3c7634a46bf449e90a7d870cbdc8693d6d4f77c601ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_functions::regex::regexpcount::regexp_count_inner (cyclomatic 33): datafusion_functions::regex::regexpcount::regexp_count_inner 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":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63784faf7667a037ce6221166ef25b66350e193e87cc200370b9bda208ece34"}},{"ruleId":"D1","level":"warning","message":{"text":"check_rust_workflow_skips.check_skip_conditions (cyclomatic 33): check_rust_workflow_skips.check_skip_conditions 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":"ci/scripts/check_rust_workflow_skips.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"463c44dc0a1b7e611f280d113a292c6646a03097f3553d2e950bcf7be0a00168"}},{"ruleId":"D1","level":"warning","message":{"text":"PropagateEmptyRelation::rewrite (cyclomatic 32): PropagateEmptyRelation::rewrite 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":"datafusion/optimizer/src/propagate_empty_relation.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bded0187ad6410fcc2742d02338c11754e43b68cd8f105e9e29866b3f5da20d"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_expr::expressions::in_list::primitive_filter::instantiate_branchless_filter (cyclomatic 32): datafusion_physical_expr::expressions::in_list::primitive_filter::instantiate_branchless_filter 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":"datafusion/physical-expr/src/expressions/in_list/primitive_filter.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66de0e504f7a1dc6337ed58e6d4b0db0b637939ce1963352c2d41b72fd6f3dc"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalPlan::max_rows (cyclomatic 31): LogicalPlan::max_rows 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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56096599bab7604a6ee6aefe062d8f5653895910f306bfa6a687320e15a1143"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_proto::physical_plan::from_proto::parse_physical_expr_with_converter (cyclomatic 31): datafusion_proto::physical_plan::from_proto::parse_physical_expr_with_converter 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":"datafusion/proto/src/physical_plan/from_proto.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe20e98417c117adba00b1e38b356f76e6eee1378264c35d69a98b5a05c0355"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionStateBuilder::build (cyclomatic 29): SessionStateBuilder::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":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02c954a965e4b28f068a9be585bb33762dc4504d8b0b882e1a5506bf162e99a"}},{"ruleId":"D1","level":"warning","message":{"text":"ColumnarValueRef::write_bytes (cyclomatic 29): ColumnarValueRef::write_bytes has cyclomatic complexity 29 (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":"datafusion/functions/src/strings.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4039593b2af24846588a3daa25f5c0c6daa130cb14a5f9ec297fc9342c03197"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_optimizer::optimize_projections::optimize_projections (cyclomatic 29): datafusion_optimizer::optimize_projections::optimize_projections 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":"datafusion/optimizer/src/optimize_projections/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad772065210db03eb28d07de7b8840ce22635318bb0203749817b7750e950a47"}},{"ruleId":"D1","level":"warning","message":{"text":"FileSinkConfig::deserialize (cyclomatic 28): FileSinkConfig::deserialize 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":"datafusion/proto-models/src/generated/pbjson.rs"},"region":{"startLine":8109}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a999d473c108d82467b067c131fb946482baa6ac53e4867cf6eb9191c2f0e6"}},{"ruleId":"D1","level":"warning","message":{"text":"DateTruncFunc::invoke_with_args (cyclomatic 28): DateTruncFunc::invoke_with_args has cyclomatic complexity 28 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 4 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. This is NOT this file\u0027s highest cyclomatic complexity: datafusion_functions::datetime::date_trunc::constant_granularity_step (cyclomatic 29) 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":"datafusion/functions/src/datetime/date_trunc.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"152333f019e306c41c8725c528b3a06bd6cf09374e4e6e31a545ffbf8db7306e"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_functions::math::round::round_columnar (cyclomatic 28): datafusion_functions::math::round::round_columnar has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/round.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"6924ca388a9d7efa80988f3f2f814fd412512450b0606a7a540d4333fd9242e4"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeRenderVisitor::render_box_content (cyclomatic 28): TreeRenderVisitor::render_box_content 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":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41116864297274f03317f4a5112779e3f4246dabef3043cdbfbd264ae3d8357"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_distribution::enforce_distribution_relationships (cyclomatic 27): datafusion_physical_optimizer::ensure_requirements::enforce_distribution::enforce_distribution_relationships 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"001f6a5e0a16820756d2959c3640503c6a3067c9a217175d010e23b467f3ccf6"}},{"ruleId":"D1","level":"warning","message":{"text":"GroupedHashAggregateStream::poll_next (cyclomatic 27): GroupedHashAggregateStream::poll_next 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":"datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23be9a67a74d33f7235def1fb3f34c66e7e31ef4b27f549480f24fe2fae848d"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarValue::distance_u64 (cyclomatic 26): ScalarValue::distance_u64 has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ScalarValue::fmt (cyclomatic 59) 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":2951}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba99ee38006bff7593e407800af5666584ace91344e08a73bfcd681f4a2f7800"}},{"ruleId":"D1","level":"warning","message":{"text":"CsvOptions::try_from (cyclomatic 26): CsvOptions::try_from has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-models/src/from_proto.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e566d9a1eaa6c68e7adeb105cc65f27ee18fda8c04a64fa92b0c252bedfa4816"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::to_field (cyclomatic 26): Expr::to_field has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"051e6809da31d0e4e19afd1a0acae4445ff43a9a1b229387e1a7d4da19b3962e"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_optimizer::decorrelate_lateral_join::rewrite_internal (cyclomatic 26): datafusion_optimizer::decorrelate_lateral_join::rewrite_internal has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate_lateral_join.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7399fae7439091ee12e58807cd69ee5db011915bc4ce70348f7ce9907eeaae45"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryExpr::evaluate (cyclomatic 26): BinaryExpr::evaluate 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":"datafusion/physical-expr/src/expressions/binary.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a9cfd1ed938d9249fff185ca2687ef045101a8749571926e851573f4ede0a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Unparser::unparse_table_scan_pushdown (cyclomatic 26): Unparser::unparse_table_scan_pushdown 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":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"629c203192148bc3ba5e5230b12b57fb126a791bf92500395b67ff72f7456760"}},{"ruleId":"D1","level":"warning","message":{"text":"ConcatFunc::invoke_with_args (cyclomatic 25): ConcatFunc::invoke_with_args 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":"datafusion/functions/src/string/concat.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d216563b020e0384724d65dd0eb6628e3de45023cee7d94504d5aa6cc5e19a69"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_optimizer::push_down_filter::push_down_all_join (cyclomatic 25): datafusion_optimizer::push_down_filter::push_down_all_join 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":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d679d36b7e9f2c05881982e4fcd103ef50d6d865d05f24f98108780ba8ef67c"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_requirement_to_children (cyclomatic 25): datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_requirement_to_children 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62f0359076e241f220b529dc2ebf0ea2b15889590bef6a2ff469e81eac1d1f4"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_sqllogictest::bin::sqllogictests::run_tests (cyclomatic 25): datafusion_sqllogictest::bin::sqllogictests::run_tests 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":"datafusion/sqllogictest/bin/sqllogictests.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc89c28f8b6d82a6fcfa3f80e7a8c8f319032c649668412f504567171f92319"}},{"ruleId":"D1","level":"warning","message":{"text":"cancel_merge_queue_runs.run (cyclomatic 25): cancel_merge_queue_runs.run 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":"ci/scripts/cancel_merge_queue_runs.cjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba17bd5322b66b7611bf5576b0bdac6b1dec9f21d483cdcc15fd2dd9456b326a"}},{"ruleId":"D1","level":"warning","message":{"text":"ListingTableFactory::create_inner (cyclomatic 24): ListingTableFactory::create_inner has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/listing_table_factory.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c3d39b807a98f8b57594d7a8dc6a4b1ae67df1f339884938e1df5d23f8484e"}},{"ruleId":"D1","level":"warning","message":{"text":"AlignedBoundaryStream::poll_next (cyclomatic 24): AlignedBoundaryStream::poll_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":"datafusion/datasource/src/boundary_stream.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9613be2ae6deb43615e84eb42fd6ff569cee743e581c794d431a8d7537f806"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanState::poll_scan (cyclomatic 24): ScanState::poll_scan 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":"datafusion/datasource/src/file_stream/scan_state.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"595c0e2a71c02c0f8236b3f9e10d7e579552c905cc095d89f6cc948ec5108bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"PagePruningAccessPlanFilter::prune_plan_with_page_index_and_metrics (cyclomatic 24): PagePruningAccessPlanFilter::prune_plan_with_page_index_and_metrics 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":"datafusion/datasource-parquet/src/page_filter.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2834af37cda6d7d6a1a41a828251f52a2335fdb1582a335f2d50de6a40e51fb"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalPlan::map_expressions (cyclomatic 24): LogicalPlan::map_expressions has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: LogicalPlan::map_children (cyclomatic 28) 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":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"14267ef70daa0451fe19040e69e8c86bef55d18f3b446a3bc2aadbcf1c207ee3"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryExpr::propagate_constraints (cyclomatic 24): BinaryExpr::propagate_constraints 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":"datafusion/physical-expr/src/expressions/binary.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"7494ee01bd6be702c014a758605d3393b736f1fa3737e935fd12405f7cd7b637"}},{"ruleId":"D1","level":"warning","message":{"text":"PushDecoderStreamState::transition (cyclomatic 23): PushDecoderStreamState::transition 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":"datafusion/datasource-parquet/src/push_decoder.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dbaab57f783eda2d36ab7e19b0b12844c1ed65cadf0c4fe3b2b610a29b35bd"}},{"ruleId":"D1","level":"warning","message":{"text":"PredicateBoundsEvaluator::evaluate_bounds (cyclomatic 23): PredicateBoundsEvaluator::evaluate_bounds has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/predicate_bounds.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e49b3fb25b4baa901b6af6d4dea9683687ade22cece661afc80feeef447e3c2"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_expr::logical_plan::builder::recursive_type_can_be_coerced (cyclomatic 23): datafusion_expr::logical_plan::builder::recursive_type_can_be_coerced has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3545f2de5ae7041af23ec1ccd13cdca4948d7c994a2f4902124490fca7e8b1d"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeSignature::to_string_repr_with_names (cyclomatic 23): TypeSignature::to_string_repr_with_names has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: datafusion_expr_common::signature::get_data_types (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"957f8f0c61c208e9a2b69927f39468ca14129f67d8ea272475c778554a60884b"}},{"ruleId":"D1","level":"warning","message":{"text":"RoundFunc::invoke_with_args (cyclomatic 23): RoundFunc::invoke_with_args 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":"datafusion/functions/src/math/round.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efcb9495c72ec6ccf0e62ec87ad8b7e8668ed08d95f75a93c7b3283e901d8ca"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_optimizer::push_down_limit::topk_through_join::push_topk_through_join (cyclomatic 23): datafusion_optimizer::push_down_limit::topk_through_join::push_topk_through_join 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":"datafusion/optimizer/src/push_down_limit/topk_through_join.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0b2c354ecfb2b246bfdd78ac9e308c10eb0ac6a4130185f21bd755b1477a0d"}},{"ruleId":"D1","level":"warning","message":{"text":"CsvWriterOptions::try_from (cyclomatic 22): CsvWriterOptions::try_from 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":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"a766c0b7f8d71dd22757ac4cee3ac2554356c911e1eee1bfa5150b4fe895956b"}},{"ruleId":"D1","level":"warning","message":{"text":"ParquetColumnOptions::deserialize (cyclomatic 22): ParquetColumnOptions::deserialize has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ScalarValue::serialize (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":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":6120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f522fe19af8c84bc358ef82ecd4983bb5669b77a154114eac9ca2ce3eb042ea4"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion::bin::print_functions_docs::print_docs (cyclomatic 22): datafusion::bin::print_functions_docs::print_docs 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":"datafusion/core/src/bin/print_functions_docs.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ea5832b275bff3001ed3dea5ac567f3692e243cc18137093e6d3daea296c56"}},{"ruleId":"D1","level":"warning","message":{"text":"PartitionedFile::deserialize (cyclomatic 22): PartitionedFile::deserialize 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":"datafusion/proto-models/src/generated/pbjson.rs"},"region":{"startLine":18236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3515da9653003ee0c2aa01690a97f1024b26d9e7d2509fae4973adb2a02f83"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryTypeCoercer::signature_inner (cyclomatic 22): BinaryTypeCoercer::signature_inner 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":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"91568d26f5fd0e3434cec50e790bcb34e13ef41a4884105fc6a59983036d7511"}},{"ruleId":"D1","level":"warning","message":{"text":"ColumnarValueRef::from_columnar_value (cyclomatic 22): ColumnarValueRef::from_columnar_value 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":"datafusion/functions/src/strings.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c18e8095e720e15cf0513c31539656d8acd9d69fca550c7124f4f7c6b1c380"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_sorts_helper (cyclomatic 22): datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_sorts_helper 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac0b00a1623d01c572001e849f25a87c4f8ce36a72b3b22d0ca98296ae2bb88"}},{"ruleId":"D1","level":"warning","message":{"text":"JoinStatisticsProvider::compute_statistics (cyclomatic 22): JoinStatisticsProvider::compute_statistics has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/operator_statistics/mod.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"a588adbfdb158934012bcaec8eaf8dcdb25071098ec2ed1fe577f14e0303e9fd"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_substrait::logical_plan::consumer::rel::read_rel::from_read_rel (cyclomatic 22): datafusion_substrait::logical_plan::consumer::rel::read_rel::from_read_rel has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to 2 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":"datafusion/substrait/src/logical_plan/consumer/rel/read_rel.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f7c589790e3495ded1e51782992ef1e343d369b4489d7cf542204912ff9336"}},{"ruleId":"D1","level":"warning","message":{"text":"BloomFilterStatistics::check_scalar (cyclomatic 21): BloomFilterStatistics::check_scalar 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":"datafusion/datasource-parquet/src/bloom_filter.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d262efcf98c949a37f76bbd630e71aa03c1d225c1d5cbaff1f61085d1d9528c"}},{"ruleId":"D1","level":"warning","message":{"text":"InformationSchemaColumnsBuilder::add_column (cyclomatic 21): InformationSchemaColumnsBuilder::add_column 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":"datafusion/expr/src/logical_plan/information_schema.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8203f021d895c92429c01f8dc7cab6859a8ce5c2698a744c28d2085ad5f1320d"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_functions::string::concat::simplify_concat (cyclomatic 21): datafusion_functions::string::concat::simplify_concat 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":"datafusion/functions/src/string/concat.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a014b58773005fab5e9efa47c580cc082c54aa9204e9155e5b15f30109d44ca"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_optimizer::extract_leaf_expressions::split_and_push_projection (cyclomatic 21): datafusion_optimizer::extract_leaf_expressions::split_and_push_projection 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":"datafusion/optimizer/src/extract_leaf_expressions.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b4fe042cadc35e51416821ec282ecbd78aca2762677cea852d0422dc6b2aaa"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_optimizer::optimizer::map_children_mut (cyclomatic 21): datafusion_optimizer::optimizer::map_children_mut 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":"datafusion/optimizer/src/optimizer.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d443c4293d8cd18a9aa30d3b5dc19cdc46c02f4c4a71e64e38a42c295e37b9"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_optimizer::push_down_limit::rewrite_limit (cyclomatic 21): datafusion_optimizer::push_down_limit::rewrite_limit 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":"datafusion/optimizer/src/push_down_limit.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc9db0ccd6010a8e7656d4d781d15db30cc10d4761f3ca01b06fa86eacaf892"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultPhysicalExprAdapterRewriter::try_narrow_struct_cast (cyclomatic 21): DefaultPhysicalExprAdapterRewriter::try_narrow_struct_cast 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":"datafusion/physical-expr-adapter/src/schema_rewriter.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"725a6d726989a610128fe76d2ee94729471f36b3ba245afc6434ce17d44ce84f"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_expr_common::datum::compare_op_for_nested (cyclomatic 21): datafusion_physical_expr_common::datum::compare_op_for_nested 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":"datafusion/physical-expr-common/src/datum.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c70a21ef6b85dcc496f3d78e60a666580a906153d8c57a505c720ac1ac8ecb"}},{"ruleId":"D1","level":"warning","message":{"text":"SpillReaderStream::poll_next (cyclomatic 21): SpillReaderStream::poll_next has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/spill/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d807997aab47bac41625175f597e5eb2e07e5abd268b369c716439dceed6ff"}},{"ruleId":"D1","level":"warning","message":{"text":"DFParser::parse_create_external_table (cyclomatic 21): DFParser::parse_create_external_table has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/parser.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8aa20aa8194230e01384f3b2c98e32ba0c5c91851a2e584fcecce976c1b90e"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlToRel::merge_clause_to_plan (cyclomatic 21): SqlToRel::merge_clause_to_plan 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":"datafusion/sql/src/statement.rs"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"4906619246afbd89d1c18fc60d8bf3c56d2e83203c502c3fb555e36a00400305"}},{"ruleId":"D1","level":"warning","message":{"text":"PullUpCorrelatedExpr::f_down (cyclomatic 20): PullUpCorrelatedExpr::f_down 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":"datafusion/optimizer/src/decorrelate.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2148e3fa4c2987ff4332bf0a86890e79c9ca552e8dfa51aa05fab1b5beb8fc"}},{"ruleId":"D1","level":"warning","message":{"text":"AggregateExec::try_optimize_topk (cyclomatic 20): AggregateExec::try_optimize_topk 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":"datafusion/physical-plan/src/aggregates/optimizations.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"484e84401e5f3b9aaf7e58d8cf4890334734dda39339a9026b6c1a12f9595289"}},{"ruleId":"D1","level":"warning","message":{"text":"DFSchema::datatype_is_semantically_equal (cyclomatic 19): DFSchema::datatype_is_semantically_equal 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: datafusion_common::dfschema::format_simple_data_type (cyclomatic 31) 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":"datafusion/common/src/dfschema.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9959eaeb09bd45fae065e0bbeba0fb1b864544a72a64716186093286095176a"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultPhysicalPlanner::handle_explain (cyclomatic 19): DefaultPhysicalPlanner::handle_explain 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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b21aaac7c40b5cf088b12b2a8e753113f915edcf353b98a7b3cb949d8d16db"}},{"ruleId":"D1","level":"warning","message":{"text":"FileSinkConfig::serialize (cyclomatic 19): FileSinkConfig::serialize 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":"datafusion/proto-models/src/generated/pbjson.rs"},"region":{"startLine":8039}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7435f5cf1f568e68dc082d863e2f5037e7017af26cacc85b37a273fce83633a"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_expr::higher_order_function::resolve_higher_order_function (cyclomatic 19): datafusion_expr::higher_order_function::resolve_higher_order_function 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":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedfed71ca85655a6a25149d7c31c3c104a39fb1d561d6d0d3ad2655bdaed3d6"}},{"ruleId":"D1","level":"warning","message":{"text":"TruncFunc::invoke_with_args (cyclomatic 19): TruncFunc::invoke_with_args 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":"datafusion/functions/src/math/trunc.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1626d7258c14421984edc1db7d67714faef38977f4379a212061bcd91d9dc3"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_functions::string::concat_ws::simplify_concat_ws (cyclomatic 19): datafusion_functions::string::concat_ws::simplify_concat_ws 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":"datafusion/functions/src/string/concat_ws.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8966b07da7d1f0ef7664302e2543d97df4a23f87bd79cf6583fa4ece604978b5"}},{"ruleId":"D1","level":"warning","message":{"text":"BytesValueState::take (cyclomatic 19): BytesValueState::take 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":"datafusion/functions-aggregate/src/first_last/state.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a5f7a6876547dfc1dafa024364142e2285630f9d6362fd2579454aed5bae50"}},{"ruleId":"D1","level":"warning","message":{"text":"MinMaxBytesAccumulator::build_array (cyclomatic 19): MinMaxBytesAccumulator::build_array 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":"datafusion/functions-aggregate/src/min_max/min_max_bytes.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d1f1d5d4c3e20b2da9b8fdc8079ffe104b0f129bd86c75249c011a232fb850"}},{"ruleId":"D1","level":"warning","message":{"text":"Range::gen_range_timestamp (cyclomatic 19): Range::gen_range_timestamp has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, 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":"datafusion/functions-nested/src/range.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e871dd88d0dd26eced6f28115d02c5985ea08f954c8c147fb8284d3b767a62a"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowShiftEvaluator::evaluate (cyclomatic 19): WindowShiftEvaluator::evaluate 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":"datafusion/functions-window/src/lead_lag.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e63e4eb783bd15808df0ffdce6604c063664bb4ee83c9ea07f3c726d0b4e28"}},{"ruleId":"D1","level":"warning","message":{"text":"NthValueEvaluator::memoize (cyclomatic 19): NthValueEvaluator::memoize 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":"datafusion/functions-window/src/nth_value.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a803d91842a790db4c6831af977426962f2dca50ddaa57408301ba8c9be86f2e"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiLevelMergeBuilder::get_sorted_spill_files_to_merge (cyclomatic 19): MultiLevelMergeBuilder::get_sorted_spill_files_to_merge 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":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8b735ca3f3b6cfb6529262bc630dca36ddc7bac80100a0489aaa600f5784ae"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_plan::joins::nested_loop_join::build_unmatched_batch (cyclomatic 19): datafusion_physical_plan::joins::nested_loop_join::build_unmatched_batch 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":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b1b67c70c9e5839d6d12466038271f5e9427518d5440b45bde705f6fd331e9"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultPhysicalPlanner::plan_aggregate (cyclomatic 18): DefaultPhysicalPlanner::plan_aggregate 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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"393b9866fc8c3fe33bd39375e4bb3be7622748b830dd984246f0cc468e0a5025"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonArrayToNdjsonReader::process_byte (cyclomatic 18): JsonArrayToNdjsonReader::process_byte 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":"datafusion/datasource-json/src/utils.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e95b770282fab59c388d9db4327539775ea976f128b79fe268fe4875b54cf74"}},{"ruleId":"D1","level":"warning","message":{"text":"ParquetOpenState::transition (cyclomatic 18): ParquetOpenState::transition 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":"datafusion/datasource-parquet/src/opener/mod.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7891fdb8bcddca25bdf17c029265272ff1022c1bc1f8bf382a0a1a3abc51bd2"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalPlan::head_output_expr (cyclomatic 18): LogicalPlan::head_output_expr has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: LogicalPlan::schema (cyclomatic 29) 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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dcb399812d1d2ef1156b381f8ea4bcd92c88d8bbaa0eeba791575b5c75ecb7"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_expr::logical_plan::invariants::check_subquery_expr (cyclomatic 18): datafusion_expr::logical_plan::invariants::check_subquery_expr has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/invariants.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f942d443959e9f6d5311bdeaebab8dd08a9075360563480b3d011ed64d2c19c"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_expr_common::casts::is_exact_cast_safe (cyclomatic 18): datafusion_expr_common::casts::is_exact_cast_safe 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":"datafusion/expr-common/src/casts.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ca9578a00d9689e2dd5f4737506f7c828ce3e8b7ed422e40b4b4903fc79849"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_functions_nested::arrays_zip::arrays_zip_inner (cyclomatic 18): datafusion_functions_nested::arrays_zip::arrays_zip_inner 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":"datafusion/functions-nested/src/arrays_zip.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2302ebb31b6cf6e59608d4c1506afea1009219adc7eb461f101d7bd8478001d7"}},{"ruleId":"D1","level":"warning","message":{"text":"ScalarSubqueryToJoin::rewrite (cyclomatic 18): ScalarSubqueryToJoin::rewrite 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":"datafusion/optimizer/src/scalar_subquery_to_join.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"354e06ef3d928b7778a5d622d5f97d54f66b4521f350c78abe2c50865df23741"}},{"ruleId":"D1","level":"warning","message":{"text":"StandardWindowExpr::evaluate_stateful (cyclomatic 18): StandardWindowExpr::evaluate_stateful 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":"datafusion/physical-expr/src/window/standard.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f718f7e5f62446d5eb31457606f39d475c188242b34cb0231dd9e1a2d3fe97"}},{"ruleId":"D1","level":"warning","message":{"text":"ClusteredSingleAggregateStream::handle_reading_input (cyclomatic 18): ClusteredSingleAggregateStream::handle_reading_input 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":"datafusion/physical-plan/src/aggregates/clustered_single_stream.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"755c8ccea37922badd52b425e76b576e4a33a08896e1fa84a3747571f2b9dd41"}},{"ruleId":"D1","level":"warning","message":{"text":"NestedLoopJoinStream::poll_next (cyclomatic 18): NestedLoopJoinStream::poll_next 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":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"436ce5edf4c48013cfa6e59e8b70efffcd820283a4d12070d2b0ed97f332da2d"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiLevelMergeBuilder::split_spill_file_in_half (cyclomatic 18): MultiLevelMergeBuilder::split_spill_file_in_half 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":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"fced24075c4efa2cb273307cee9ce335c4b8cf280a0447d5f158c998f89c56f2"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_plan::joins::hash_join::exec::build_in_memory (cyclomatic 18): datafusion_physical_plan::joins::hash_join::exec::build_in_memory 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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"751a517b968c4c9482feaa4e1babe5219864ab2885e6e39996d2f598f17e5ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_plan::projection::try_pushdown_through_join_with_column_indices (cyclomatic 18): datafusion_physical_plan::projection::try_pushdown_through_join_with_column_indices 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":"datafusion/physical-plan/src/projection.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"696af0729c44940bf58519ddfd178747fcd0530f9f43e7eecd6533d4094fd28e"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlToRel::insert_to_plan (cyclomatic 18): SqlToRel::insert_to_plan 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":"datafusion/sql/src/statement.rs"},"region":{"startLine":2728}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ed2b04ec9cf948511e224243dbd769ebbad9e8d106346e841f71a78f06ffee"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_sql::unparser::utils::date_part_to_sql (cyclomatic 18): datafusion_sql::unparser::utils::date_part_to_sql 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":"datafusion/sql/src/unparser/utils.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"561ddd7d1928ba0ad63fb35945cf144872a9fac11aa46013767e65471b49a776"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_macros::user_doc::user_doc (cyclomatic 18): datafusion_macros::user_doc::user_doc 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":"datafusion/macros/src/user_doc.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe48379aa0bc8ee51c270e502196ccfa7e713b5d1cc308add657637385008c6f"}},{"ruleId":"D1","level":"warning","message":{"text":"ListingTable::scan_with_args_inner (cyclomatic 17): ListingTable::scan_with_args_inner 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":"datafusion/catalog-listing/src/table.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c398dbcd2c143532ddf36edbb8e6ede8478f20ef480eeac59d50ac2b7f6efd"}},{"ruleId":"D1","level":"warning","message":{"text":"RowGroupsPrunedParquetOpen::should_load_page_index (cyclomatic 17): RowGroupsPrunedParquetOpen::should_load_page_index 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":"datafusion/datasource-parquet/src/opener/mod.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ff41ad142d7b33776d90fdb4524c94f5ae472a8be9f335d5d6eff1e03dc5fd"}},{"ruleId":"D1","level":"warning","message":{"text":"ToTimestampFunc::invoke_with_args (cyclomatic 17): ToTimestampFunc::invoke_with_args 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":"datafusion/functions/src/datetime/to_timestamp.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b68a65a22e0060fa38e23bda0ee43fd2dffb112561873aef1028ead698be84a"}},{"ruleId":"D1","level":"warning","message":{"text":"FloorFunc::preimage (cyclomatic 17): FloorFunc::preimage 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":"datafusion/functions/src/math/floor.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb38a376bf91265991cfad6cf4328332add0c0f1e50923cbcf569bd463dbed9"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitPartFunc::invoke_with_args (cyclomatic 17): SplitPartFunc::invoke_with_args 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":"datafusion/functions/src/string/split_part.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"44320998f383a6030ce76a596a243e8ca6d851d13ccd73acd02a40648c0fde71"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_functions::datetime::date_trunc::general_date_trunc (cyclomatic 17): datafusion_functions::datetime::date_trunc::general_date_trunc has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: datafusion_functions::datetime::date_trunc::constant_granularity_step (cyclomatic 29) 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":"datafusion/functions/src/datetime/date_trunc.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4ae65a1970e7411c4565260bc3b1f8c83f768656df04cae8fe9fbeb839382e"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_functions_nested::set_ops::generic_set_loop (cyclomatic 17): datafusion_functions_nested::set_ops::generic_set_loop 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":"datafusion/functions-nested/src/set_ops.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba296f2608a11f271014707dc91b6511aa694ce6512d5d3af9c4226f5a3a3720"}},{"ruleId":"D1","level":"warning","message":{"text":"PushdownSort::optimize (cyclomatic 17): PushdownSort::optimize 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":"datafusion/physical-optimizer/src/pushdown_sort.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"009265974f52c2f8260b5ef4ccefd60e2d4b2492e38360916a6b36da4c29e8a1"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_distribution::adjust_input_keys_ordering (cyclomatic 17): datafusion_physical_optimizer::ensure_requirements::enforce_distribution::adjust_input_keys_ordering 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"39942a040edb50ca4cc2569116996cd89dc2ce04e161e9374435ebce0e3ff55a"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_physical_plan::joins::hash_join::not_in::mark_null_candidates_for_probe_batch (cyclomatic 17): datafusion_physical_plan::joins::hash_join::not_in::mark_null_candidates_for_probe_batch 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":"datafusion/physical-plan/src/joins/hash_join/not_in.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c410c59b19f11f532914ad8cc8f2531b316084cbeb1e0c2ef8ff584fcbf350"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionArgs::try_new (cyclomatic 17): FunctionArgs::try_new 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":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4629e1614e33853497bd260f6d4e258ba3e94f7c468f016a75de872e76ee6afe"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_substrait::physical_plan::consumer::from_substrait_rel (cyclomatic 17): datafusion_substrait::physical_plan::consumer::from_substrait_rel 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":"datafusion/substrait/src/physical_plan/consumer.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e2a88a6f91115c13e23268d07d77a5aec5cff4a6a690f4948d88e792b756ee"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_common::nested_struct::compact_list_view_values (cyclomatic 16): datafusion_common::nested_struct::compact_list_view_values 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":"datafusion/common/src/nested_struct.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"4157f7879e196449a3c9a8d6c87253a771dd22c7113478b9fb485b77db7846ad"}},{"ruleId":"D1","level":"warning","message":{"text":"PushdownChecker::f_down (cyclomatic 16): PushdownChecker::f_down 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":"datafusion/datasource-parquet/src/projection_read_plan.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"68567e6bd4df71c5e42f9955bdb7ecbc8808d3e761a5710d9d94a910dc7dcdf9"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowFrameStateGroups::calculate_index_of_row (cyclomatic 16): WindowFrameStateGroups::calculate_index_of_row 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":"datafusion/expr/src/window_state.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cea6a53fc5292ae2df8e3957489cf52fbe9d2dc49e226a5cacb90ab527a05a"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_expr::type_coercion::functions::value_fields_with_higher_order_udf (cyclomatic 16): datafusion_expr::type_coercion::functions::value_fields_with_higher_order_udf has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: datafusion_expr::type_coercion::functions::coerced_from (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"548d3e3d39582729e318b1b6cd148bb39e8d3edb83fc811716ea983812f3b261"}},{"ruleId":"D1","level":"warning","message":{"text":"FindInSetFunc::invoke_with_args (cyclomatic 16): FindInSetFunc::invoke_with_args 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":"datafusion/functions/src/unicode/find_in_set.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0713f87ec3605612629e41b136c6c188b422d7cdcfa314119281e76749e149e"}},{"ruleId":"D1","level":"warning","message":{"text":"TDigest::estimate_quantile (cyclomatic 16): TDigest::estimate_quantile 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":"datafusion/functions-aggregate-common/src/tdigest.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ffa967a76573eea5b1bc9fc1be3c42a4a7f28d2fe7c4e876b1ff68447f8854"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_functions_nested::resize::general_list_resize (cyclomatic 16): datafusion_functions_nested::resize::general_list_resize 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":"datafusion/functions-nested/src/resize.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a581b46de8f542c5b3c2333f0d8c63fa27af69c4a2bb65dd822ce9cd25018c7"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_optimizer::single_distinct_to_groupby::is_single_distinct_agg (cyclomatic 16): datafusion_optimizer::single_distinct_to_groupby::is_single_distinct_agg 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":"datafusion/optimizer/src/single_distinct_to_groupby.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"74195684d9d068ab1353ef675799b47be4e39a7183cfa0397cf8ffc1d88500de"}},{"ruleId":"D1","level":"warning","message":{"text":"InListExpr::evaluate (cyclomatic 16): InListExpr::evaluate 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":"datafusion/physical-expr/src/expressions/in_list.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8da1aa769c456fefe408874f7116a9c51a0bb4fcc5c3225334f9430a685e187"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayMap::lookup_and_get_indices (cyclomatic 16): ArrayMap::lookup_and_get_indices 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":"datafusion/physical-plan/src/joins/array_map.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0872587c491520277fb26557ca96640211df2e48895ad368adc05a080d39437e"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_pruning::pruning_predicate::build_compact_in_list_expr (cyclomatic 16): datafusion_pruning::pruning_predicate::build_compact_in_list_expr 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":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"6895b0394ca21c58d5757427957b4a15253daa670e681d2bb20c0fec41e96f03"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlToRel::sql_compound_identifier_to_expr (cyclomatic 16): SqlToRel::sql_compound_identifier_to_expr has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/identifier.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e128644bee203832bee315318a24953604ea6cd5dbd782f92419054c5fb65c"}},{"ruleId":"D1","level":"warning","message":{"text":"SqlToRel::explain_to_plan (cyclomatic 16): SqlToRel::explain_to_plan 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":"datafusion/sql/src/statement.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c34aa755b042cd336cca8bdba6954d5c42cae7915a832e49669a1a4e090151"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_substrait::logical_plan::consumer::expr::subquery::from_subquery (cyclomatic 16): datafusion_substrait::logical_plan::consumer::expr::subquery::from_subquery 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":"datafusion/substrait/src/logical_plan/consumer/expr/subquery.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57621187c70766ad183815000689f196843af3d27af0d8bf97e103bca0a0445"}},{"ruleId":"D1","level":"warning","message":{"text":"datafusion_cli::exec::exec_from_repl (cyclomatic 16): datafusion_cli::exec::exec_from_repl 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":"datafusion-cli/src/exec.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d675bce311e2c1159a801f1154f5df151ef8de56e0bf8599f502a898c2f029fe"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-changelog.generate_changelog (cyclomatic 16): generate-changelog.generate_changelog 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":"dev/release/generate-changelog.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3df7820998e50a77924c295e1b49d5027fda46d306fa024634d1507edebca9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Unparser::select_to_sql_recursively (cognitive 270): Unparser::select_to_sql_recursively has cognitive complexity 270 (threshold 15). Drivers by points: if/else 94 (224 pts), match/switch 9 (23 pts), boolean chains 16, loops 3 (7 pts) (nesting depth added 148). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"9caf12d89eb5d5709aee3cb0aec5ebf48097f5887fd65d6f293213afb128db23"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::sql_statement_to_plan_with_context_impl (cognitive 237): SqlToRel::sql_statement_to_plan_with_context_impl has cognitive complexity 237 (threshold 15). Drivers by points: if/else 145 (183 pts), match/switch 23 (50 pts), boolean chains 4 (nesting depth added 65). 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":"datafusion/sql/src/statement.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed944291c6003ff24d92d9f43feacf4e8c8c5342127a659cf33407ec43f7a07"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::sql_function_to_expr (cognitive 191): SqlToRel::sql_function_to_expr has cognitive complexity 191 (threshold 15). Drivers by points: if/else 61 (125 pts), match/switch 13 (39 pts), loops 6 (16 pts), boolean chains 11 (nesting depth added 100). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05a980925729f684696408cd6fe69b76660882c00c74da27554e0a587c95e25"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultPhysicalPlanner::map_logical_node_to_physical (cognitive 163): DefaultPhysicalPlanner::map_logical_node_to_physical has cognitive complexity 163 (threshold 15). Drivers by points: if/else 50 (100 pts), match/switch 17 (44 pts), boolean chains 11, loops 3 (8 pts) (nesting depth added 82). Of this number, 159 points are the body\u0027s own statements and 4 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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a5e63680bb6e45f91204c0f25e81632c5a82171508d3ad5170d3463877fbaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier::f_up (cognitive 161): Simplifier::f_up has cognitive complexity 161 (threshold 15). Drivers by points: if/else 40 (74 pts), boolean chains 44, match/switch 19 (37 pts), loops 3 (6 pts) (nesting depth added 55). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b622ea57c0e5be5227e68060034f942d32f6df46f4d2e69fb8b1e9a5722e898"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarValue::deserialize (cognitive 139): ScalarValue::deserialize has cognitive complexity 139 (threshold 15). Drivers by points: if/else 45 (135 pts), match/switch 2 (3 pts), loops 1 (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":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":8916}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f920f4a1b36931288d21d3f300ec1f774a006fc9ed1678a2963cfac175b8c2"}},{"ruleId":"D2","level":"warning","message":{"text":"ParquetOptions::deserialize (cognitive 124): ParquetOptions::deserialize has cognitive complexity 124 (threshold 15). Drivers by points: if/else 40 (120 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":6796}}}],"partialFingerprints":{"codehealthFindingId/v1":"7934b524d7e47ce049445898e001923fd4800860fc295ea3b857aa01afc9618d"}},{"ruleId":"D2","level":"warning","message":{"text":"PushDownFilter::rewrite (cognitive 109): PushDownFilter::rewrite has cognitive complexity 109 (threshold 15). Drivers by points: if/else 37 (63 pts), loops 11 (25 pts), boolean chains 16, match/switch 3 (5 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf2d947f0ea030deb8e9b2093f0f4a1110b5b9841895ddc2cba08478519c6b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ParquetOptions::serialize (cognitive 106): ParquetOptions::serialize has cognitive complexity 106 (threshold 15). Drivers by points: if/else 80, match/switch 13 (26 pts) (nesting depth added 13). 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":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":6464}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f21d8c5b2e54561cf27aa4441fc8996c228af13b8755685c06800d217356f8"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_expr::type_coercion::functions::get_valid_types (cognitive 103): datafusion_expr::type_coercion::functions::get_valid_types has cognitive complexity 103 (threshold 15). Drivers by points: if/else 40 (72 pts), match/switch 11 (20 pts), loops 6 (11 pts) (nesting depth added 46). Of this number, 63 points are the body\u0027s own statements and 40 belong to 8 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":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de088c7f8e8a728eb67fb2df72a932e5353ffe5ff626c06ab0d2f365e0c923d"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::windows::window_equivalence_properties (cognitive 102): datafusion_physical_plan::windows::window_equivalence_properties has cognitive complexity 102 (threshold 15). Drivers by points: if/else 22 (70 pts), loops 6 (23 pts), boolean chains 9 (nesting depth added 65). 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":"datafusion/physical-plan/src/windows/mod.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"627c4fd0926405d2b6f35f0a0e97340aa70e4f21b3dd8b7f69b25488282e22bb"}},{"ruleId":"D2","level":"warning","message":{"text":"PullUpCorrelatedExpr::f_up (cognitive 98): PullUpCorrelatedExpr::f_up has cognitive complexity 98 (threshold 15). Drivers by points: if/else 35 (72 pts), boolean chains 9, match/switch 4 (9 pts), loops 4 (8 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":"datafusion/optimizer/src/decorrelate.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"3277b0933694ef556948e200ad0c504dc955cb8086884f8bf0193a01c238ec37"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_substrait::logical_plan::consumer::expr::literal::from_substrait_literal (cognitive 84): datafusion_substrait::logical_plan::consumer::expr::literal::from_substrait_literal has cognitive complexity 84 (threshold 15). Drivers by points: match/switch 24 (43 pts), if/else 14 (38 pts), loops 1 (2 pts), boolean chains 1 (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":"datafusion/substrait/src/logical_plan/consumer/expr/literal.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"35789e023de46e32b53635cb4c47e2957efa063faa06a9766fc85eb76c7e1a82"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarValue::iter_to_array (cognitive 81): ScalarValue::iter_to_array has cognitive complexity 81 (threshold 15). Drivers by points: if/else 33 (53 pts), match/switch 12 (22 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 33). Of this number, 69 points are the body\u0027s own statements and 12 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"af67b9a2990072db3bae56b5835dce8190510040c3e48933648dd155a83c067b"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvOptions::deserialize (cognitive 73): CsvOptions::deserialize has cognitive complexity 73 (threshold 15). Drivers by points: if/else 23 (69 pts), match/switch 2 (3 pts), loops 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":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"040bb4d83e5a777160691312b5b3387000a42fcdf30ad3fa9373f70cee00e851"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupedHashAggregateStream::poll_next (cognitive 67): GroupedHashAggregateStream::poll_next has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (54 pts), match/switch 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadaee85d136a95e55370d87ab686036a0f145dc4d3265f8511f59bc0827a42a"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeRenderVisitor::render_box_content (cognitive 65): TreeRenderVisitor::render_box_content has cognitive complexity 65 (threshold 15). Drivers by points: if/else 21 (53 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5e33409602dad803d068c2669dccb3c4f3e1fc2e9793cbff59a3e520516d9d"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_distribution::enforce_distribution_relationships (cognitive 63): datafusion_physical_optimizer::ensure_requirements::enforce_distribution::enforce_distribution_relationships has cognitive complexity 63 (threshold 15). Drivers by points: if/else 19 (44 pts), match/switch 3 (9 pts), boolean chains 5, loops 3 (5 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf5470566254e5b10c608707228276219587a5d4ddced2fd8cc946b72405495"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalPlan::display (cognitive 62): LogicalPlan::display has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 10 (21 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":2173}}}],"partialFingerprints":{"codehealthFindingId/v1":"07569a5c84efb6db1c3dbab1aaae20034d152f27162ef0154a058e961020eec6"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::decorrelate_predicate_subquery::build_join (cognitive 60): datafusion_optimizer::decorrelate_predicate_subquery::build_join has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 17, match/switch 6 (9 pts), loops 2 (5 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":"datafusion/optimizer/src/decorrelate_predicate_subquery.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eefab16e533803378d3f4a5e07bed1affe9fd14b3fd002ecb443faeeb36b948"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_datasource::write::demux::compute_partition_keys_by_row (cognitive 59): datafusion_datasource::write::demux::compute_partition_keys_by_row has cognitive complexity 59 (threshold 15). Drivers by points: loops 18 (52 pts), if/else 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 37). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/write/demux.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb001e9068378cf2699778b0ebfbd027b6712043d43c1665e7ab4f7eec168c9"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion::bin::print_functions_docs::print_docs (cognitive 57): datafusion::bin::print_functions_docs::print_docs has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 8 (23 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/bin/print_functions_docs.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b75188926f74e3b7d63d701a9c62e640eca2c39eb0fb37391544a24c3c16f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_distribution::ensure_distribution_with_stats (cognitive 56): datafusion_physical_optimizer::ensure_requirements::enforce_distribution::ensure_distribution_with_stats has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 13, match/switch 4 (10 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"500e06b46a36dd2adc75b3757909beb58e9d6aca37546e14a7dc278fe0050792"}},{"ruleId":"D2","level":"warning","message":{"text":"check_rust_workflow_skips.check_skip_conditions (cognitive 56): check_rust_workflow_skips.check_skip_conditions has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (36 pts), loops 7 (11 pts), boolean chains 9 (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":"ci/scripts/check_rust_workflow_skips.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd50509ca617950477526ec4bd04fac6877fe4edba4d5fd390f56893b477b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvWriterOptions::deserialize (cognitive 55): CsvWriterOptions::deserialize has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (51 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b71377cd54f6f7c3e06ab90a276fcb1ba23186dc6f07c95eab8b52199ac50ba"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_substrait::logical_plan::consumer::types::from_substrait_type (cognitive 55): datafusion_substrait::logical_plan::consumer::types::from_substrait_type has cognitive complexity 55 (threshold 15). Drivers by points: match/switch 18 (48 pts), if/else 3 (7 pts) (nesting depth added 34). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/types.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a248faafabe37a95dc7cc3691dc0e76912b9df57695c93bb28afcc5772619fd8"}},{"ruleId":"D2","level":"warning","message":{"text":"AlignedBoundaryStream::poll_next (cognitive 53): AlignedBoundaryStream::poll_next has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (40 pts), match/switch 4 (12 pts), loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/boundary_stream.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6b0dbf428f4cabc08740b092015ba93a23edb7ac691b487f1dfd308036d0ee"}},{"ruleId":"D2","level":"warning","message":{"text":"SpillReaderStream::poll_next (cognitive 52): SpillReaderStream::poll_next has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (37 pts), match/switch 4 (13 pts), boolean chains 1, 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":"datafusion/physical-plan/src/spill/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fae1d9353bbed48fa50d8d47e6dcf5165908da097702ad719e086f6ec87360"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionStateBuilder::build (cognitive 51): SessionStateBuilder::build has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 8 (16 pts), match/switch 3 (10 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":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"0042de0cae1c38f055e326a0c5ee655bf5c3fa3fb6936a4f06fa0417a7d88fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"PgJsonVisitor::to_json_value (cognitive 49): PgJsonVisitor::to_json_value has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (38 pts), match/switch 5 (11 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":"datafusion/expr/src/logical_plan/display.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87252740692901d665f3bbbcc025d76fdd3cef20cb422899a90958a8544b7af"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarSubqueryToJoin::rewrite (cognitive 49): ScalarSubqueryToJoin::rewrite has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 5 (11 pts), boolean chains 1, match/switch 1 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/scalar_subquery_to_join.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d51cca1fdbb529d8f2fcb86615b443390a0ad15694d5dd40a2320b3af59e99"}},{"ruleId":"D2","level":"warning","message":{"text":"PagePruningAccessPlanFilter::prune_plan_with_page_index_and_metrics (cognitive 48): PagePruningAccessPlanFilter::prune_plan_with_page_index_and_metrics has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (4 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":"datafusion/datasource-parquet/src/page_filter.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27a97e13bca9b5d4a121a8cf6610842c4f7406410f0cc99694635988735f8bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Unparser::unparse_table_scan_pushdown (cognitive 48): Unparser::unparse_table_scan_pushdown has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4597fa4f629f4f939e6024d137ba1130254fdb7a7e8cfa48fa2abbe2e0af703"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_cli::exec::exec_from_repl (cognitive 48): datafusion_cli::exec::exec_from_repl has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (29 pts), match/switch 4 (15 pts), loops 2 (4 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion-cli/src/exec.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"351e32b8ce541a74d246766857dcd482ccff990f3ebba9a587ba5a5fce34e9aa"}},{"ruleId":"D2","level":"warning","message":{"text":"PushDecoderStreamState::transition (cognitive 47): PushDecoderStreamState::transition has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (32 pts), match/switch 4 (11 pts), boolean chains 3, loops 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":"datafusion/datasource-parquet/src/push_decoder.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"05761a39c3dcde72098ad48bc69fdb15c2b469b22c11b8c7679ef4f04e84d312"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcatWsFunc::invoke_with_args (cognitive 47): ConcatWsFunc::invoke_with_args has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 8 (22 pts), if/else 9 (18 pts), loops 3 (7 pts) (nesting depth added 27). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/concat_ws.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88872d9ceed203c56bd0d27b3ef6e8e507d4416fbb24e68c1b64f9e89928c74"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::string::compute_array_to_string (cognitive 47): datafusion_functions_nested::string::compute_array_to_string has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (37 pts), loops 4 (7 pts), match/switch 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/string.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a8ed7f3e37f8807babd063846eeae2ebde29b5e941e304493f169fad3657b6"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::select_to_plan (cognitive 47): SqlToRel::select_to_plan has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (30 pts), match/switch 7 (8 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/select.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9aa8463c5ed4d514cbd14ae1cb944f765a914006b2025e4aac430d8150c3c52"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvOptions::serialize (cognitive 46): CsvOptions::serialize has cognitive complexity 46 (threshold 15). Drivers by points: if/else 46. 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":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"a884d212d8e136ca27e347180373067de71f43cf908dcdaf43c3c9807b931120"}},{"ruleId":"D2","level":"warning","message":{"text":"ListingTableFactory::create_inner (cognitive 46): ListingTableFactory::create_inner has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 5 (15 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/listing_table_factory.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3940ce5f71c789f5634d88bdfe41a1585516d56b56d2ef6c559d0390d7017a"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarValue::to_array_of_size (cognitive 45): ScalarValue::to_array_of_size has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 14 (23 pts), if/else 9 (19 pts), loops 1 (3 pts) (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":3745}}}],"partialFingerprints":{"codehealthFindingId/v1":"21eeea08f1003aba86b0978d0b5390923d3cca9c943230d3721d801544211281"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::fmt (cognitive 45): Expr::fmt has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (29 pts), match/switch 7 (14 pts), loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr.rs"},"region":{"startLine":3620}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37857efd19aebb23bd938dc559ba5e42d969ac38695a994e76f701599a3d543"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_pruning::pruning_predicate::build_predicate_expression (cognitive 44): datafusion_pruning::pruning_predicate::build_predicate_expression has cognitive complexity 44 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 5, match/switch 3 (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":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3bda34614b504097f01acadfcac2da564890e631ad86f27b683477d063f70e"}},{"ruleId":"D2","level":"warning","message":{"text":"cancel_merge_queue_runs.run (cognitive 44): cancel_merge_queue_runs.run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (30 pts), error handling 3 (6 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/scripts/cancel_merge_queue_runs.cjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bb692378c6ef593279a5e79d352c6d6ca11404c6b4598e2cd3fb51ca4a8c5f"}},{"ruleId":"D2","level":"warning","message":{"text":"PlanType::deserialize (cognitive 43): PlanType::deserialize has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (39 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-models/src/generated/pbjson.rs"},"region":{"startLine":24813}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81a226178f0ef273bb8e33238736ecc53934c9509b0e1e33c6884e38966ed52"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::regex::regexpcount::regexp_count_inner (cognitive 43): datafusion_functions::regex::regexpcount::regexp_count_inner has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 7, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"686decbcc1aeec828890191950127573ec7cd4dcc94e29de6bff61d42fc3ab5e"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_expr::planner::create_physical_expr (cognitive 42): datafusion_physical_expr::planner::create_physical_expr has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 8 (16 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/planner.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b4076340acf0245bee919f7bb97f274705b3f07d41b62c520f1cbc19a1e3fd"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaDisplay::fmt (cognitive 41): SchemaDisplay::fmt has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 6 (11 pts), loops 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr.rs"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d199f4f217143e430cff93e5a38e0651559d85f38f8cc5356bb589513533d0"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::set_ops::generic_set_loop (cognitive 41): datafusion_functions_nested::set_ops::generic_set_loop has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 5 (13 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/set_ops.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0eaaaeefc2995f7879f0bb05e3184790d8f8423f73a29064453a0e5a700a50"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_sorts_helper (cognitive 41): datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_sorts_helper has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (31 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9806b3a5b30a005de0ed0dd317319050c08838b4cb17590d4ba490152f1a77"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::datetime::common::handle_multiple (cognitive 40): datafusion_functions::datetime::common::handle_multiple has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 8 (23 pts), if/else 3 (11 pts), loops 2 (6 pts) (nesting depth added 27). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/common.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85ef90506654489a5607f10b35e202ef57b261d742de16d13ebf695f67cdd1a"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::decorrelate_lateral_join::rewrite_internal (cognitive 40): datafusion_optimizer::decorrelate_lateral_join::rewrite_internal has cognitive complexity 40 (threshold 15). Drivers by points: if/else 24 (30 pts), boolean chains 6, loops 2 (4 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":"datafusion/optimizer/src/decorrelate_lateral_join.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"912b48aaae8316527a361f864c65a1186aef97bae2826a7f057aa8e88567054c"}},{"ruleId":"D2","level":"warning","message":{"text":"Unparser::expr_to_sql_inner (cognitive 40): Unparser::expr_to_sql_inner has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 5 (9 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b05665064d6df067ab3ffa81dccd4df514af642f2cdee5257e9ed56c600957b"}},{"ruleId":"D2","level":"warning","message":{"text":"StandardWindowExpr::evaluate_stateful (cognitive 39): StandardWindowExpr::evaluate_stateful has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (34 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/window/standard.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e595e65fb22d345d1724e8538e5af078679dc00b59d6d99d2b00769bdc43c27f"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::expr_source_side (cognitive 39): datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::expr_source_side has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 3 (11 pts), boolean chains 1, match/switch 1 (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c22b04abd188994f251d82f1babe7c739edebcaee714e2d97ff58999755a101"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::aggregates::get_finer_aggregate_exprs_requirement (cognitive 39): datafusion_physical_plan::aggregates::get_finer_aggregate_exprs_requirement has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (36 pts), loops 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":2983}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04353f628780ef34c6bb1d74a44bad32eba9dc967de0ef6af0b9a44e14b83c3"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::sql_compound_identifier_to_expr (cognitive 39): SqlToRel::sql_compound_identifier_to_expr has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (12 pts), loops 2 (7 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/identifier.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"858ac1f5ad599f2e7a3e675c91a7d48a52cfca1d2c5e77036e5c4f737061b754"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultPhysicalPlanner::handle_explain (cognitive 38): DefaultPhysicalPlanner::handle_explain has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (31 pts), match/switch 3 (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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"55be7fad45c6afb51e9d265622ed481a5633ccc9b0487acb55391bd23b561439"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanState::poll_scan (cognitive 38): ScanState::poll_scan has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 9 (16 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":"datafusion/datasource/src/file_stream/scan_state.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"412ba4c83b28588c7f94435c4ff91787e7c90cec7c01a09812ce098f71afe8a1"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_expr::logical_plan::invariants::check_subquery_expr (cognitive 38): datafusion_expr::logical_plan::invariants::check_subquery_expr has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 4 (11 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":"datafusion/expr/src/logical_plan/invariants.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2718ad6d89ea73e3673d9be179219aa8b931fa44c08f083ef247e9737163ac"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiLevelMergeBuilder::get_sorted_spill_files_to_merge (cognitive 38): MultiLevelMergeBuilder::get_sorted_spill_files_to_merge has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 3 (8 pts), boolean chains 6, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b99a41f9e4b85632665305e00a4e0f962202fa870077a6e70f31fca22bbd6da"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonOpener::open (cognitive 37): JsonOpener::open has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (8 pts), loops 2 (7 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":"datafusion/datasource-json/src/source.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"16687f3315f283f8a8ed534058887536bca6284910c705142e42fff79d6ba86f"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_expr::higher_order_function::resolve_higher_order_function (cognitive 37): datafusion_expr::higher_order_function::resolve_higher_order_function has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (12 pts), match/switch 5 (9 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fdfdfcaae98be0214a55771c7744f3890035f372977e3fc62f74ea6c8c87d7"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvOptions::try_from (cognitive 36): CsvOptions::try_from has cognitive complexity 36 (threshold 15). Drivers by points: if/else 34, match/switch 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-models/src/from_proto.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c3b7d3f6697fb859cfa8568d2af4da8278fcefcc2d750943f1c80256159419"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::normalize_eq (cognitive 36): Expr::normalize_eq has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 22, match/switch 5 (9 pts), if/else 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":"datafusion/expr/src/expr.rs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9355d638f82ea7115908a44d4aa251c74ea657b28f0c3bdded72af236049a0dd"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::arrays_zip::try_perfect_list_zip (cognitive 36): datafusion_functions_nested::arrays_zip::try_perfect_list_zip has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (9 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/arrays_zip.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"78640d5d53f8b41b671828c53092789ff1b137ce5885c302b6c00ccf5b20dd34"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayMap::lookup_and_get_indices (cognitive 36): ArrayMap::lookup_and_get_indices has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (4 pts), match/switch 2 (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":"datafusion/physical-plan/src/joins/array_map.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdc4eec3b292041ea68f10d0d92e2f4fc09ae08ef730c74d255140576ab343f"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::nullable (cognitive 35): Expr::nullable has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 7 (13 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d9d311ff6712d058646d0f30115a1af31ab19f234eb174e70ee838af3559be"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnarValueRef::from_columnar_value (cognitive 35): ColumnarValueRef::from_columnar_value has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 3 (5 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/strings.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"151f55457dd3b7a16841e119b28d648c0299b4fffd11690d80cb9b261d68f0c0"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowShiftEvaluator::evaluate (cognitive 35): WindowShiftEvaluator::evaluate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-window/src/lead_lag.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9f3f494db62bde3801df4510c07c669db647a15f40737c28c9b3450fee1c79"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::extract_leaf_expressions::split_and_push_projection (cognitive 35): datafusion_optimizer::extract_leaf_expressions::split_and_push_projection has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 4, loops 2 (4 pts), match/switch 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/extract_leaf_expressions.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"3955aeedaada3ef7e6ff7dac3ca766849caa2ca1aaeb8b31e133899926994a19"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryExpr::propagate_constraints (cognitive 35): BinaryExpr::propagate_constraints has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 10 (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":"datafusion/physical-expr/src/expressions/binary.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"3968839d0325e09566900ce243b67f1544554629a290c035d7f595a5c55abcc0"}},{"ruleId":"D2","level":"warning","message":{"text":"InListExpr::evaluate (cognitive 35): InListExpr::evaluate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (2 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":"datafusion/physical-expr/src/expressions/in_list.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd84a6b3f7ae6dd751e5e6b4d96fe1b8a7866e46b89b80e6e123f093225a55ff"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::nested_loop_join::build_unmatched_batch (cognitive 35): datafusion_physical_plan::joins::nested_loop_join::build_unmatched_batch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a101dcd4daea9bcbaceba1427f1996c66fc541eb1af2281dae7b207d1257c4"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_substrait::logical_plan::consumer::rel::read_rel::from_read_rel (cognitive 35): datafusion_substrait::logical_plan::consumer::rel::read_rel::from_read_rel has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 5 (10 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 16). Of this number, 28 points are the body\u0027s own statements and 7 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":"datafusion/substrait/src/logical_plan/consumer/rel/read_rel.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03a2131ddc6651c41060b1e93174e9639e84d9d1ab30b1472743f1f93577891"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_substrait::physical_plan::consumer::from_substrait_rel (cognitive 35): datafusion_substrait::physical_plan::consumer::from_substrait_rel has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (10 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/physical_plan/consumer.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4436b8974794bcb9f6c6def1fac19a431183463c51291672aab806ee683738c2"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvWriterOptions::serialize (cognitive 34): CsvWriterOptions::serialize has cognitive complexity 34 (threshold 15). Drivers by points: if/else 34. 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":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0c642f13eff9935e2983af78a95be7e160e3434bb5b8cab07df6e7a840ed11"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::unicode::substrindex::substr_index_scalar_view (cognitive 34): datafusion_functions::unicode::substrindex::substr_index_scalar_view has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (10 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":"datafusion/functions/src/unicode/substrindex.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a2e0b2916d926f2e3368ae0a8e1fba946a048a637a12fda114536a6e1a5c36"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::optimize_projections::optimize_projections (cognitive 34): datafusion_optimizer::optimize_projections::optimize_projections has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 4 (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":"datafusion/optimizer/src/optimize_projections/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af53c4d3d8bde0b6949e54efea2fccf2de8c6577b6d646b3e5c4b6365923c20"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::merge_clause_to_plan (cognitive 34): SqlToRel::merge_clause_to_plan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 5 (8 pts), loops 2 (4 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":"datafusion/sql/src/statement.rs"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d58a8d458f11fd7b4896b32a9e98fc675c6fa355aa21695e0c617c80b38bdcf"}},{"ruleId":"D2","level":"warning","message":{"text":"RoundFunc::invoke_with_args (cognitive 33): RoundFunc::invoke_with_args has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/round.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"54773a4660216d1e8450dc1404e412368d267f25daab38bf24385896861f5d12"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_requirement_to_children (cognitive 33): datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_requirement_to_children has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc93750cd5595c721466699698f7e29915cf14af784904b82c6fa8523d56e67b"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterializingSortMergeJoinStream::freeze_streamed_matched (cognitive 33): MaterializingSortMergeJoinStream::freeze_streamed_matched has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 2 (7 pts), match/switch 1 (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":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a10ddf14361c839cf06547c710e63d96732febdbd091b9e2aefbea85e46228"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialSortStream::poll_next_inner (cognitive 33): PartialSortStream::poll_next_inner has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/partial_sort.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7ee27a2a823aac7c01a5053425bf379e4353d93c3314371e109fd86dde57d9"}},{"ruleId":"D2","level":"warning","message":{"text":"PartitionedTopKDenseRank::insert_batch (cognitive 33): PartitionedTopKDenseRank::insert_batch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 5 (10 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":2868}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c949bc4faca823bc5fdc1db0b6e3d4e3790924111ddebac4aebf6fafd0eb7b"}},{"ruleId":"D2","level":"warning","message":{"text":"DFParser::parse_create_external_table (cognitive 33): DFParser::parse_create_external_table has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 3, match/switch 1 (3 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":"datafusion/sql/src/parser.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7eaf5ba3d22f63f63cc3d1ec4e853d88ea7c257cb13029744c026aa5ea741b0"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::hash_utils::hash_dictionary_scatter (cognitive 32): datafusion_common::hash_utils::hash_dictionary_scatter has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (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":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee064dac15faac53023a5670a14b6a5922875912a4ba15cefdf242cd4292240"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_expr_common::type_coercion::binary::try_type_union_resolution_with_struct (cognitive 32): datafusion_expr_common::type_coercion::binary::try_type_union_resolution_with_struct has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 5 (9 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e7ea129d212bb5a068b6caf14493abfd3f959e92d6db7c41184bd844ae79ab"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::extract_leaf_expressions::build_extraction_projection_impl (cognitive 32): datafusion_optimizer::extract_leaf_expressions::build_extraction_projection_impl has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/extract_leaf_expressions.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a4fa42874b10ec20943a52806e51472b373002f6072be2e97e85e88ab14d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvWriterOptions::try_from (cognitive 31): CsvWriterOptions::try_from has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (29 pts), match/switch 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":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01bece69b3e1d375c67561b2247518d361b51406d233ec2a3608489660b1069"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSinkConfig::deserialize (cognitive 31): FileSinkConfig::deserialize has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-models/src/generated/pbjson.rs"},"region":{"startLine":8109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e0cdaf078f868719113e9f867a215038dfa0f47c3e6d3f1c81b3f19fbb13ce"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeSignature::to_string_repr_with_names (cognitive 31): TypeSignature::to_string_repr_with_names has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (27 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":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95d08a6acf160b586b9460c0c8193dd70b43c4496e9d0b7157e8bce656b28e0"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::math::round::round_columnar (cognitive 31): datafusion_functions::math::round::round_columnar has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 14, if/else 10 (14 pts), match/switch 2 (3 pts) (nesting depth added 5). 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":"datafusion/functions/src/math/round.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb645203df96624fb469e56e3ecf920c71cadc9707281fe84122dd72ecd537c3"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_window::lead_lag::evaluate_all_with_ignore_null (cognitive 31): datafusion_functions_window::lead_lag::evaluate_all_with_ignore_null has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-window/src/lead_lag.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3ce6ef483794acc812d2bc6f9f21e5553beff5f7ac91748d59ad1ffa282246"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvFormat::infer_schema_from_stream (cognitive 30): CsvFormat::infer_schema_from_stream has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-csv/src/file_format.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"29aee3aceb1245dea3599ec6f2acf8849da9bf32c5b02be3efdb23e4350b4bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"PushdownChecker::f_down (cognitive 30): PushdownChecker::f_down has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 5, match/switch 1 (4 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/projection_read_plan.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac3794b03b0982104238d6f0e33eb3002de083f67e191c2cfb692e924b72b82"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::string::concat_ws::simplify_concat_ws (cognitive 30): datafusion_functions::string::concat_ws::simplify_concat_ws has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (18 pts), if/else 3 (9 pts), loops 1 (3 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":"datafusion/functions/src/string/concat_ws.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71b844fcc21deed27c79dbe44601ce870e1cc90c64c5a6f2c44e562a2d8b923"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::arrays_zip::arrays_zip_inner (cognitive 30): datafusion_functions_nested::arrays_zip::arrays_zip_inner has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (6 pts), match/switch 3 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/arrays_zip.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9459df4cdeaae3d5469a79d8c40bb095ca820a3832ae0519db0197e93f1ba6"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleDistinctToGroupBy::rewrite (cognitive 30): SingleDistinctToGroupBy::rewrite has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 4 (9 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":"datafusion/optimizer/src/single_distinct_to_groupby.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c57da479cf08826672f38bfd100e377f29f151a479234e2ed470d6ad90268e5"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::simplify_expressions::simplify_predicates::find_most_restrictive_predicate (cognitive 30): datafusion_optimizer::simplify_expressions::simplify_predicates::find_most_restrictive_predicate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/simplify_predicates.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ab2382274f199d9c7be811353e7ebfa1d88a8276778b4d9bbf3390d7643512"}},{"ruleId":"D2","level":"warning","message":{"text":"AsOfJoinStream::poll_next_impl (cognitive 30): AsOfJoinStream::poll_next_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (3 pts), match/switch 1 (3 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":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3507856c44f3d2576e17d56835c535ac09bb0153ba7ebaa6cbd849c859bee512"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::utils::max_distinct_count (cognitive 30): datafusion_physical_plan::joins::utils::max_distinct_count has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 4 (8 pts), boolean chains 3 (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":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"302d878fb9c4d6ffe6c0354dafa3744c713b6e19a395c4833405dd8c06d020d4"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::insert_to_plan (cognitive 30): SqlToRel::insert_to_plan has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4 (9 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/statement.rs"},"region":{"startLine":2728}}}],"partialFingerprints":{"codehealthFindingId/v1":"789b5cb7f8ddd67d211d7b98482a816dea14921e9ad68933400a44d5567c03d7"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalPlan::with_new_exprs (cognitive 29): LogicalPlan::with_new_exprs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 5 (10 pts), loops 2 (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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab097cf6b3fe36810b2656c9ec602053e11520fa669cb8b49be4e370cd821cc"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupsAccumulatorAdapter::invoke_per_accumulator_with_scratch (cognitive 29): GroupsAccumulatorAdapter::invoke_per_accumulator_with_scratch has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 7 (11 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb56df8973fd7902372f501d37fe906aea9b7e21182ca1a1394b683698a16034"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::replace::general_replace (cognitive 29): datafusion_functions_nested::replace::general_replace has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/replace.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93fe18f0cc89a91c2e00b4e467c23d5788418fcc72e9e161e3340e99d5558c5"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::string::string_to_array_scalar_args (cognitive 29): datafusion_functions_nested::string::string_to_array_scalar_args has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 5 (13 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/string.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9763d6886a9347087630aacf4f52a7f3d6a3575982d9c2a9592ad95730f939"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::extract_leaf_expressions::try_push_into_inputs (cognitive 29): datafusion_optimizer::extract_leaf_expressions::try_push_into_inputs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/extract_leaf_expressions.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcbc4fb09a92865a6cd32b23e902ecb355c89116359ab2042eb4f8984a83388"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::push_down_filter::push_down_all_join (cognitive 29): datafusion_optimizer::push_down_filter::push_down_all_join has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 6, loops 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":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"61641689d80919dab65e7d6a44e1e404d2a9dc9ae6193cc0c8c702c502e455c2"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryExpr::evaluate (cognitive 29): BinaryExpr::evaluate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/binary.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"d593bffda46291048dab2e54c488de9509895088c5b72631d975dc14676869b1"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregateExec::fmt_as (cognitive 29): AggregateExec::fmt_as has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (28 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f2b0cc7c102a9cd3364ae9fbeb234ef5d2fec5f1e6c7a8c634bdee00378f25"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiLevelMergeBuilder::split_spill_file_in_half (cognitive 29): MultiLevelMergeBuilder::split_spill_file_in_half has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 6, loops 1 (2 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dccdd8f5b0768a7c28a7b89bbd9d9c384ad46e5e88fa2b855e4e73dedd24db"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::hash_join::exec::build_in_memory (cognitive 29): datafusion_physical_plan::joins::hash_join::exec::build_in_memory has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (2 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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5533094daf2b2758ea8f2c45f2c955e8bf6db729a033583082050418291c9358"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarValue::partial_cmp (cognitive 28): ScalarValue::partial_cmp has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 4 (5 pts), boolean chains 2 (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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b854333de94a68711cc75fbb29c0cd7902afac2dd0c5af948ee7e439667db3"}},{"ruleId":"D2","level":"warning","message":{"text":"ParquetColumnOptions::serialize (cognitive 28): ParquetColumnOptions::serialize has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14, match/switch 7 (14 pts) (nesting depth added 7). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":6036}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a2d08bf339326470fef4f45e711779c73f4188970effabc23b4738bcc151a9"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::functional_dependencies::aggregate_functional_dependencies_with_computed_inputs (cognitive 28): datafusion_common::functional_dependencies::aggregate_functional_dependencies_with_computed_inputs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (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":"datafusion/common/src/functional_dependencies.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a09a97cfcce09273079e93e9545d20a98471b0299cf7658d272c482328838d"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame::describe (cognitive 28): DataFrame::describe has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d78ab9422c2bd51b425b64273250decca7bbf238468044d5e06258be66a627e"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonArrayToNdjsonReader::process_byte (cognitive 28): JsonArrayToNdjsonReader::process_byte has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-json/src/utils.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f82897246c8396520bd37158d26b63f0ce62d524e8fa4baf35b0f8aac43888"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalPlanBuilder::infer_data (cognitive 28): LogicalPlanBuilder::infer_data has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (3 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":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"e341ddf49439e83442977d2df1b604920e57611b50d77ca3807c2756c4a5d447"}},{"ruleId":"D2","level":"warning","message":{"text":"DictionaryGroupValuesColumn::vectorized_append (cognitive 28): DictionaryGroupValuesColumn::vectorized_append has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/dictionary.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"4191bcc608bcbfb71c0ec4a68ea0f9c84341cb1801d4b7a1575c66072e3f9db2"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyRangeBitmap::union (cognitive 28): KeyRangeBitmap::union has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/key_range_bitmap.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9be002fa09ce5fea1f6dff0d3988458c197c13f3e9eb5a11fddb3c90c734d5"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::convert_simple_data_type (cognitive 28): SqlToRel::convert_simple_data_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 5 (10 pts), boolean chains 3 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/planner.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"8947443a84e5ce8bb1558f17edb2333fa9ec8950a00831c874d764bfaa15c1b4"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_sqllogictest::bin::sqllogictests::run_tests (cognitive 28): datafusion_sqllogictest::bin::sqllogictests::run_tests has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 5, loops 2 (4 pts), match/switch 3 (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":"datafusion/sqllogictest/bin/sqllogictests.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd4444e3f1c10eedbbf605e20a6dbe22bd8a06db4944bcb2b9560350e49221f"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultPhysicalPlanner::plan_aggregate (cognitive 27): DefaultPhysicalPlanner::plan_aggregate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"49647082fcfb43ac7a8327eedd898bfe2ec4ede65eb19d8d75b1cde918e33737"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowFrameStateRange::calculate_index_of_row (cognitive 27): WindowFrameStateRange::calculate_index_of_row has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (8 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":"datafusion/expr/src/window_state.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdf071c011be1a30c43c9f438e9d5b470910210b7e4e42ae483b97959810c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"DictionaryGroupValuesColumn::vectorized_equal_to (cognitive 27): DictionaryGroupValuesColumn::vectorized_equal_to has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/dictionary.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"7079abe38857429b4e8ecdcb0ba873238f46067c4d58724c8fa6fce61f5f7bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"NestedLoopJoinStream::poll_next (cognitive 27): NestedLoopJoinStream::poll_next has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 9 (26 pts), loops 1 (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":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfbbee493fd302f701f51a6ef1ce187c6eb18bef11b5568cd0a4742a62dacbc"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_expr_common::casts::try_cast_numeric_literal (cognitive 26): datafusion_expr_common::casts::try_cast_numeric_literal has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 5 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/casts.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"926b03a168ffd8bb71750ad5e0f2f7af2e2e18139f22628ad3862eb227bd78ec"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::regex::regexpreplace::regexp_replace (cognitive 26): datafusion_functions::regex::regexpreplace::regexp_replace has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 9 (19 pts), if/else 3 (7 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpreplace.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a61e3ee0859a11c8e6cf4115653f32970f6e13fbf5bc0ab22059d787f639b3"}},{"ruleId":"D2","level":"warning","message":{"text":"TDigest::estimate_quantile (cognitive 26): TDigest::estimate_quantile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (20 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":"datafusion/functions-aggregate-common/src/tdigest.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd0aa3b90dce8bf70b72cf5216512652a1a13d2c53758eba9b34ffdebea8b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"CommonSubexprEliminate::try_optimize_aggregate (cognitive 26): CommonSubexprEliminate::try_optimize_aggregate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (4 pts), match/switch 2 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/common_subexpr_eliminate.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"246d7c3e947c27de83c46badf1a84ae3796e8e9f5ac9f84d5696245ffbe66b84"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::push_down_limit::rewrite_limit (cognitive 26): datafusion_optimizer::push_down_limit::rewrite_limit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 1, 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":"datafusion/optimizer/src/push_down_limit.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"151fa48e2c99f0692825708ac5a36bca5c145729edf36d859de31e6ac0899e38"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::push_down_limit::topk_through_join::push_topk_through_join (cognitive 26): datafusion_optimizer::push_down_limit::topk_through_join::push_topk_through_join has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 8 (11 pts), loops 3 (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":"datafusion/optimizer/src/push_down_limit/topk_through_join.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3782fe7691410918a7d3132f4812f5fb8abc4660cdb05426c68740d1f8d83e"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_expr::expressions::binary::check_short_circuit (cognitive 26): datafusion_physical_expr::expressions::binary::check_short_circuit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 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":"datafusion/physical-expr/src/expressions/binary.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"985d9a7b4157dbacc9036cbc7061cce3595bd26815c2b01585e6b9dcfbeda806"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowBytesMap::insert_if_new_inner (cognitive 26): ArrowBytesMap::insert_if_new_inner has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/binary_map.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"e749f650ed7dc6133ad9afc2a636c39a660edbb648420ec89fb04300e06d0370"}},{"ruleId":"D2","level":"warning","message":{"text":"PushdownSort::optimize (cognitive 26): PushdownSort::optimize has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/pushdown_sort.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"502b0dbfa0589d4c62c03df6a12b84a8cf32b5b4bbe94b7138184599233066ea"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_distribution::adjust_input_keys_ordering (cognitive 26): datafusion_physical_optimizer::ensure_requirements::enforce_distribution::adjust_input_keys_ordering has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (5 pts), loops 1 (2 pts), boolean chains 1 (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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c36310f5303f144fed09f477cc0c18649c6d884bfc3165021835eb2918236e"}},{"ruleId":"D2","level":"warning","message":{"text":"ClusteredSingleAggregateStream::handle_reading_input (cognitive 26): ClusteredSingleAggregateStream::handle_reading_input has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 6 (13 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":"datafusion/physical-plan/src/aggregates/clustered_single_stream.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e38e8c16e1444d022ba193a741ae7dc98a96b9a99abdc9776daf79728caea1"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_proto::logical_plan::from_proto::parse_expr (cognitive 26): datafusion_proto::logical_plan::from_proto::parse_expr has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 10 (18 pts), if/else 4 (8 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":"datafusion/proto/src/logical_plan/from_proto.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a289d8781ff3215f3be5070dc8e0ba88504a7f994e0db8fa3b2b2e2b948292f0"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_sql::unparser::rewrite::rewrite_plan_for_sort_on_non_projected_fields (cognitive 26): datafusion_sql::unparser::rewrite::rewrite_plan_for_sort_on_non_projected_fields has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (10 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/rewrite.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d255d928a61e903205742c1161cf7fd135f729441e54b8874cde7151db4a10"}},{"ruleId":"D2","level":"warning","message":{"text":"ParquetColumnOptions::deserialize (cognitive 25): ParquetColumnOptions::deserialize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 2 (3 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":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":6120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86ada60690b3c6563f7b4a2599fe832c9e407e3188767ebb1219c6ed2486b05"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion::physical_planner::extract_update_assignments (cognitive 25): datafusion::physical_planner::extract_update_assignments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (5 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":2949}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4543d30d5ba3f4b16297bef64d471577c29476ddca7dd11591b3b4075d8faa"}},{"ruleId":"D2","level":"warning","message":{"text":"MemorySourceConfig::repartition_preserving_order (cognitive 25): MemorySourceConfig::repartition_preserving_order has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (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":"datafusion/datasource/src/memory.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"0972413a6f31bc9be9ea0f73f079dbf2729ebf072108986ef41f5750c00493ef"}},{"ruleId":"D2","level":"warning","message":{"text":"PartitionedFile::deserialize (cognitive 25): PartitionedFile::deserialize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 2 (3 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":"datafusion/proto-models/src/generated/pbjson.rs"},"region":{"startLine":18236}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba79ba5cd7f934fa5ad63776f8fb41805c4f44159574a52032298bdf29332e5"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_datasource_parquet::schema_coercion::uniform_dict_schemas (cognitive 25): datafusion_datasource_parquet::schema_coercion::uniform_dict_schemas has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/schema_coercion.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b617cd549095b0fb5def6aa1c1d6312b30e6671eed867de91d866415b4c41c"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowFrameStateGroups::calculate_index_of_row (cognitive 25): WindowFrameStateGroups::calculate_index_of_row has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3, boolean chains 2, 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":"datafusion/expr/src/window_state.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bba7ae83007348868fddd54e01a21e01bae6eaf536afa140757d7cf4c87f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnarValueRef::write_bytes (cognitive 25): ColumnarValueRef::write_bytes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 7, 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":"datafusion/functions/src/strings.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f12c91acfd33a963af06014de980b0325621f9702fe0b9608e680ccb5754db8"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::unicode::pad::pad_impl (cognitive 25): datafusion_functions::unicode::pad::pad_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/unicode/pad.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fc016c8955ab64759b1a291bd19c5c2bea0461926e35b234f815e8dc8ac07d"}},{"ruleId":"D2","level":"warning","message":{"text":"NthValueEvaluator::memoize (cognitive 25): NthValueEvaluator::memoize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-window/src/nth_value.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e67d216b1878c614e595083e841a5cd5f62e7da56e02bc94142e1e51b8782d"}},{"ruleId":"D2","level":"warning","message":{"text":"DecorrelatePredicateSubquery::rewrite (cognitive 25): DecorrelatePredicateSubquery::rewrite has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (9 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate_predicate_subquery.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f54d50dfcaa46963836e28e96d14214e922af27c2cebdbe6f95db8ef7fb0ae"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::join_selection::statistical_join_selection_subrule (cognitive 25): datafusion_physical_optimizer::join_selection::statistical_join_selection_subrule has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/join_selection.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc7605f6358355106ca5b198a52c63b16660358f03cf0b8bac335b87697895c"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphvizVisitor::pre_visit (cognitive 25): GraphvizVisitor::pre_visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (23 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":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"8894d37beb71e1fa12600d6ab235cf22637d6a154980facc83fcfcfef8931f84"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinExec::fmt_as (cognitive 25): HashJoinExec::fmt_as has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e0b6fe21b7bec060cf3595fbbe7622974076975ff9355ccc72140701ba59b0"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterializingSortMergeJoinStream::join (cognitive 25): MaterializingSortMergeJoinStream::join has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee48a1f840287ca26bfe6db809b2413e645d30f6b6439cefc0f1d471ccc07c1"}},{"ruleId":"D2","level":"warning","message":{"text":"PrimitiveValuesRouter::route_with (cognitive 25): PrimitiveValuesRouter::route_with has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 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. This shape REPEATS in the file: one other method here (FloatValuesRouter::route_with) 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":"datafusion/physical-plan/src/repartition/range.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb949cd0b9c74b93d6128615674899375fb4a2dc0724ef98e5803a8bf76de10c"}},{"ruleId":"D2","level":"warning","message":{"text":"FloatValuesRouter::route_with (cognitive 25): FloatValuesRouter::route_with has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 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. This shape REPEATS in the file: one other method here (PrimitiveValuesRouter::route_with) 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":"datafusion/physical-plan/src/repartition/range.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6c7f2387e09865685d57027abf0f35fe1cc01c90fa3c070b578de82165c4c7"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiLevelMergeBuilder::merge_sorted_runs_within_mem_limit (cognitive 25): MultiLevelMergeBuilder::merge_sorted_runs_within_mem_limit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 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":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"509d0527a3aee20b97186a316a32b5ded9154e9e86d2b35ee91331d75268a5e8"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::join_hash_map::get_matched_indices_with_limit_offset (cognitive 25): datafusion_physical_plan::joins::join_hash_map::get_matched_indices_with_limit_offset has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (3 pts), match/switch 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":"datafusion/physical-plan/src/joins/join_hash_map.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7db3aba7578423d7cf7cb7fefaf0ce13d89daa9aeb649869ac745e9e47d6e87"}},{"ruleId":"D2","level":"warning","message":{"text":"FileScanConfig::fmt_as (cognitive 24): FileScanConfig::fmt_as has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/file_scan_config/mod.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9ed33ebe5e3301c5d9479ea24f25f615e41070432938419d46a78e665243fd"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedAccessPlan::reorder_by_statistics (cognitive 24): PreparedAccessPlan::reorder_by_statistics has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (7 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":"datafusion/datasource-parquet/src/access_plan.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df217559a5d087c393d9e1823a52c57514dfd037762913b0acfe126f37fc86b"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcatFunc::invoke_with_args (cognitive 24): ConcatFunc::invoke_with_args has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (8 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":"datafusion/functions/src/string/concat.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3ea4a491336f358025ebf2bc15aa9f969b5845ba54cd7af945a3dd8bf76da5"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::string::common::string_view_trim (cognitive 24): datafusion_functions::string::common::string_view_trim has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (8 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/common.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae76e5a14f568ce0202f70ba38953ed954126cddca88c14b2ee44dfa66938a7"}},{"ruleId":"D2","level":"warning","message":{"text":"DistinctArrayAggGroupsAccumulator::evaluate (cognitive 24): DistinctArrayAggGroupsAccumulator::evaluate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (6 pts), match/switch 3, 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":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"0314d7352ef82a3ed823ceead8ca491f4cb8306fbe60e28c08459957b5574601"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_aggregate_common::aggregate::groups_accumulator::accumulate::accumulate_indices (cognitive 24): datafusion_functions_aggregate_common::aggregate::groups_accumulator::accumulate::accumulate_indices has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"219d10d7280f2cb8ef403686c221b31014e329cd7dda235172bcd5d5ac1d62f8"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::cosine_distance::general_cosine_distance (cognitive 24): datafusion_functions_nested::cosine_distance::general_cosine_distance 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":"datafusion/functions-nested/src/cosine_distance.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f8f9f5c21c23a9fe9a441370e0361061674a339c3bcd605881635ae9ebc2ce"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::remove::general_remove (cognitive 24): datafusion_functions_nested::remove::general_remove has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/remove.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"8044c6561116e4ead46afc34cb65aaabeb81cb575037697f261cc6914b9e3fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::single_distinct_to_groupby::is_single_distinct_agg (cognitive 24): datafusion_optimizer::single_distinct_to_groupby::is_single_distinct_agg has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, loops 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":"datafusion/optimizer/src/single_distinct_to_groupby.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9c54e744e4288fc0e350f173563a877c9ecc98d9a9fa91222ce5a0e2d51d37"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderingEquivalenceClass::remove_redundant_entries (cognitive 24): OrderingEquivalenceClass::remove_redundant_entries has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (18 pts), loops 3 (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":"datafusion/physical-expr/src/equivalence/ordering.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0b3865f22467553b5804ff948353a99e997a8a2cbaba857082cff0cecc6bda"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregateExec::try_optimize_topk (cognitive 24): AggregateExec::try_optimize_topk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 7, 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":"datafusion/physical-plan/src/aggregates/optimizations.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b757291859df14aaac0a051d12bde47057e9dd77d14059397fde07ad305a616c"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeRenderVisitor::split_up_extra_info (cognitive 24): TreeRenderVisitor::split_up_extra_info has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d70dd826681ea6b488b6468830868b979d8fe852900844b87653a523054e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"RepartitionExec::pull_from_input (cognitive 24): RepartitionExec::pull_from_input has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (8 pts), match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/repartition/mod.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"feac7e6254f52886437477f23eea6ffe5aed5ef5418ace75bd9c00851e3fec58"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::utils::estimate_semi_join_cardinality (cognitive 24): datafusion_physical_plan::joins::utils::estimate_semi_join_cardinality 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":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9c74221c09042972b3ac0b90038a20188d92bd1306ef5833b27a5770326b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::utils::compare_join_arrays (cognitive 24): datafusion_physical_plan::joins::utils::compare_join_arrays has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 4 (10 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":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6b436cfcd778abf14acb345637f8979f0465729cfef2748c752c9009226f93"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_substrait::logical_plan::consumer::rel::aggregate_rel::from_aggregate_rel (cognitive 24): datafusion_substrait::logical_plan::consumer::rel::aggregate_rel::from_aggregate_rel has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (12 pts), loops 3 (7 pts), if/else 4 (5 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/rel/aggregate_rel.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bace9f4f94c0c2ab5b445b00132cd5c8ee670da9899305853e91c480d0f4867"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarValue::try_from (cognitive 23): ScalarValue::try_from has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 11 (15 pts), if/else 4 (6 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/to_proto/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45a1d8c477f4b320184da3f37ebd21a03ef5bb469b067abeb6d15e54c5fbcbf"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvOpener::open (cognitive 23): CsvOpener::open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (3 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":"datafusion/datasource-csv/src/source.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b1e8d47fc47defeaa7249312efdf06724ab15c21f3ea10fe0ad2ac77d6fe3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Documentation::to_doc_attribute (cognitive 23): Documentation::to_doc_attribute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/doc/src/lib.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f8b307e7c4c74713d8cc6abceb03b429c3263338ef2f031aa6cd32c8adc0d1"}},{"ruleId":"D2","level":"warning","message":{"text":"SignumFunc::invoke_with_args (cognitive 23): SignumFunc::invoke_with_args has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 3 (5 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":"datafusion/functions/src/math/signum.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3a1b7c3caca0ae3cc935600ec1a2aa87c7f4b528224e385d23e7d822331067"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::string::common::case_conversion_utf8view_ascii_inner (cognitive 23): datafusion_functions::string::common::case_conversion_utf8view_ascii_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/common.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8efde3193655c88f4a61fefd87d04407db48d44da8d7b0c775596b9ffa09b4a"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAggGroupsAccumulator::evaluate (cognitive 23): ArrayAggGroupsAccumulator::evaluate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (9 pts), match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc1d120d6228750dbe8eaa5db322f285fec1dcaf7b37b87412efcae21a3db3c"}},{"ruleId":"D2","level":"warning","message":{"text":"TDigest::merge_digests (cognitive 23): TDigest::merge_digests has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 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":"datafusion/functions-aggregate-common/src/tdigest.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac69e5cd5fc1b0fc1f6986c6673a3e5bb9ed16d6e534ffb9df0810ead803c4dc"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCoercionRewriter::f_up (cognitive 23): TypeCoercionRewriter::f_up has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 5 (8 pts), boolean chains 4 (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":"datafusion/optimizer/src/analyzer/type_coercion.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d4e5d1d5bc0dce1531ea75680c99a900141909eed6fdc98850088de151cfec"}},{"ruleId":"D2","level":"warning","message":{"text":"PropagateEmptyRelation::rewrite (cognitive 23): PropagateEmptyRelation::rewrite has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 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":"datafusion/optimizer/src/propagate_empty_relation.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d8e95d3483a468ec74981369a8d05ef581d5b5fff7ff3d4222577745c5f688"}},{"ruleId":"D2","level":"warning","message":{"text":"CaseBody::case_when_with_expr (cognitive 23): CaseBody::case_when_with_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/case.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"802d2606d7f5642b8a593c1a806b7b51f1634c18bab17b885b8a01372897909b"}},{"ruleId":"D2","level":"warning","message":{"text":"HigherOrderFunctionExpr::evaluate (cognitive 23): HigherOrderFunctionExpr::evaluate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, match/switch 2 (3 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":"datafusion/physical-expr/src/higher_order_function.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0de749db3df9c1e62b2fba62dd4da5f85abaa1c27f1f6af8c064e847764923"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowBytesViewMap::insert_if_new_inner (cognitive 23): ArrowBytesViewMap::insert_if_new_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/binary_view_map.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"eced2a6ada47b37f98f4de4db0fc1069bb8f9252ee015eb8b4c57e86ebd8bdbf"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterExec::statistics_helper (cognitive 23): FilterExec::statistics_helper has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"877b0f3f791dc9fb45bf108d2b6655f853dbf32cf4d1eb243e726849c92b8118"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterExec::statistics_under_fetch (cognitive 23): FilterExec::statistics_under_fetch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea029ff4607314a9085387f54467819a96ec7dbad33f8b9dcdba301a7b7455d"}},{"ruleId":"D2","level":"warning","message":{"text":"SortExec::fmt_as (cognitive 23): SortExec::fmt_as has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 3 (5 pts), loops 1 (4 pts), boolean chains 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":"datafusion/physical-plan/src/sorts/sort.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8efa81d32bc89302ca5b1be54734e77ad954ae71569b753dd6c4b89655a55d6"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::utils::calculate_join_output_ordering (cognitive 23): datafusion_physical_plan::joins::utils::calculate_join_output_ordering has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eabf1378c5f6bc93f6a6b19717b0e8a6066cc5c08192f2d46826f94e4a2e308"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::utils::estimate_join_cardinality (cognitive 23): datafusion_physical_plan::joins::utils::estimate_join_cardinality has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2666545bfd0ac3bcbae6d406d44261d8e74929fe5c7ea07940a0f4484c8669bf"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::projection::try_pushdown_through_join_with_column_indices (cognitive 23): datafusion_physical_plan::projection::try_pushdown_through_join_with_column_indices has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3 (6 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":"datafusion/physical-plan/src/projection.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a82cd21cc00bd06cd5955016c974ff161e33da2818bdfb16168075957ceed3e"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::sql_identifier_to_expr (cognitive 23): SqlToRel::sql_identifier_to_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/identifier.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5b9f994cd3ed092b7c7ee68af37eb5450e0493a437d92002ee21f53c22294e"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::try_process_group_by_unnest (cognitive 23): SqlToRel::try_process_group_by_unnest has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (8 pts), match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/select.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f24e57e271e106d00d792f6596efdfab3f0599a3abceeed0e987bd6c98dad50"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_macros::user_doc::user_doc (cognitive 23): datafusion_macros::user_doc::user_doc has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (22 pts), 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":"datafusion/macros/src/user_doc.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e87c058c5063af1b4b6b9d51b4b20d8cdfb869f2a1c3c45ddb334fb56599242"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::hash_utils::hash_sparse_union_array (cognitive 22): datafusion_common::hash_utils::hash_sparse_union_array has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 5 (9 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":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfdb4a67d7ccec049202e49e196e2bbc9d62ae3b9f4e78ce4d7bc3977703bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::datetime::common::handle_array_op (cognitive 22): datafusion_functions::datetime::common::handle_array_op has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (11 pts), if/else 4 (9 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/common.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"1844037610bee92d25692455ef9db5ca72a00e25298c0175abd6eb04588e4ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"Range::gen_range_timestamp (cognitive 22): Range::gen_range_timestamp has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (9 pts), loops 1, match/switch 1 (nesting depth added 4). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/range.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae735141045f425c2637f83c5cde233efe6fc6273a6f0bfe2827f2c43be0d936"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::range::generate_range_values (cognitive 22): datafusion_functions_nested::range::generate_range_values has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/range.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"398efecf5e5f66dced66c5c729a1c5f578a006af3466ba1cc52ce422c86a027a"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectionExprs::project_statistics_impl (cognitive 22): ProjectionExprs::project_statistics_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (8 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/projection.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"49daf8624807bdec4555de42bd3e98edbbd8dae834da8128ef507de5d71b3acb"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupValuesColumn::emit (cognitive 22): GroupValuesColumn::emit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (4 pts), loops 1 (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":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/mod.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"066a7edd0f8576ec4c49f8892c7b74c660ed42661477edd8511493e8f32c8da9"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterializingSortMergeJoinStream::extend_buffered_group (cognitive 22): MaterializingSortMergeJoinStream::extend_buffered_group has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"068c7c5b3e3ad4aedafb704c68a488842d050ddb7c1ca9d52da80bb104dee9c4"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterializingSortMergeJoinStream::materialize_right_columns (cognitive 22): MaterializingSortMergeJoinStream::materialize_right_columns has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (5 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":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"705a843ebcc12ff8f6ba7cc88f2103e6b493b9cffd909474e00be330bc69a61c"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageFramer::push (cognitive 22): MessageFramer::push has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 1 (2 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":"datafusion/physical-plan/src/spill/mod.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3474190fd37d152170a1ed1552b0718ade086e3b615e17abb2ff23721a2ea9e"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::filter::collect_null_rejecting_columns (cognitive 22): datafusion_physical_plan::filter::collect_null_rejecting_columns has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5807196ceb1cfd4df5619e1f8eb57c7985c90cce0999844a7683232858039ece"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_substrait::logical_plan::consumer::expr::window_function::from_substrait_bound (cognitive 22): datafusion_substrait::logical_plan::consumer::expr::window_function::from_substrait_bound has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 3 (6 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":"datafusion/substrait/src/logical_plan/consumer/expr/window_function.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c212b0f8c1d61966fe07f7068ac22d393c5cd686d48c85513723dc1ff6b5b947"}},{"ruleId":"D2","level":"warning","message":{"text":"InformationSchemaConfig::add_columns (cognitive 21): InformationSchemaConfig::add_columns has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (11 pts), if/else 3 (10 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf3d95b96f97b4ee7647f9769bb698c2eee39ce206e3502d13555d5666eb7c5"}},{"ruleId":"D2","level":"warning","message":{"text":"ScalarValue::try_from (cognitive 21): ScalarValue::try_from has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 4 (6 pts), loops 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":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d176990e822018c083b8773bf37af1bd9579fc34356156966b74591e7d33827c"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_datasource::file_scan_config::sort_pushdown::any_file_has_nulls_in_sort_columns (cognitive 21): datafusion_datasource::file_scan_config::sort_pushdown::any_file_has_nulls_in_sort_columns has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), match/switch 1 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/file_scan_config/sort_pushdown.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccde1a5143f20201bfdea2241457810116d7c4aa6b01bc651377ea19ebd17fe"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonFormat::infer_schema (cognitive 21): JsonFormat::infer_schema has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-json/src/file_format.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"14101cbe9c4ddded9dcc23b03ba1ccf2a5ec8e9c6c11ff058243fa7da8605779"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlDisplay::fmt (cognitive 21): SqlDisplay::fmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), match/switch 2 (3 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":"datafusion/expr/src/expr.rs"},"region":{"startLine":3364}}}],"partialFingerprints":{"codehealthFindingId/v1":"28737295c4c9764c8ec71ef5400fde2f69700aa4fb49772763121001f04d66a4"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_expr_common::statistics::create_bernoulli_from_comparison (cognitive 21): datafusion_expr_common::statistics::create_bernoulli_from_comparison has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 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":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed75bcc837e034b25937c3c927e2c535ca62d1f139bd6e054de9cad4b7f7ccd5"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::math::nanvl::nanvl_impl (cognitive 21): datafusion_functions::math::nanvl::nanvl_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/nanvl.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d0786f0ed937fa44402e079684a0786c9a6240f9b6bfc80e9046cd1db5f1ef"}},{"ruleId":"D2","level":"warning","message":{"text":"BytesValueState::take (cognitive 21): BytesValueState::take has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (12 pts), match/switch 7 (9 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":"datafusion/functions-aggregate/src/first_last/state.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"147b88c4a6eadec13f5f9633b6def881407c4c6f00a89ca78427f78182ee01ef"}},{"ruleId":"D2","level":"warning","message":{"text":"MinMaxBytesAccumulator::build_array (cognitive 21): MinMaxBytesAccumulator::build_array has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (12 pts), match/switch 7 (9 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":"datafusion/functions-aggregate/src/min_max/min_max_bytes.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40d4a070df87f0043cccc6ef2c0769567003964fa532773089107163efa8207"}},{"ruleId":"D2","level":"warning","message":{"text":"TDigest::merge_sorted_f64 (cognitive 21): TDigest::merge_sorted_f64 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 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":"datafusion/functions-aggregate-common/src/tdigest.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabfe06d0cf3da883e3b7b2fb26e5089fcc7f5184e077c676bad71d2019c697b"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::array_normalize::general_array_normalize (cognitive 21): datafusion_functions_nested::array_normalize::general_array_normalize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_normalize.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cbe5d64dceb8b15a638f259124ed2005b7d19047c39c910dbfb641186348cc"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::resize::general_list_resize (cognitive 21): datafusion_functions_nested::resize::general_list_resize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 2 (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":"datafusion/functions-nested/src/resize.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ebba8881a4a30e5b533afdd9d0c0ee0a6c82ef218a7262b349a635237514ba"}},{"ruleId":"D2","level":"warning","message":{"text":"PullUpCorrelatedExpr::f_down (cognitive 21): PullUpCorrelatedExpr::f_down has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 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":"datafusion/optimizer/src/decorrelate.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3f62a89c58b885cd92937d8ded44bd1e69d74a1055a4aa30f5e1f12ecc0623"}},{"ruleId":"D2","level":"warning","message":{"text":"Optimizer::optimize (cognitive 21): Optimizer::optimize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/optimizer.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d01001ea73224882043977f5160c39b0e3b2c94d98c7330bc91f3e703b90371"}},{"ruleId":"D2","level":"warning","message":{"text":"LiteralGuarantee::analyze (cognitive 21): LiteralGuarantee::analyze has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/utils/guarantee.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"52708c3bef270dcd3052c2c3bb0739173a3e75cb24e4138d68944abab013aa74"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultPhysicalExprAdapterRewriter::try_narrow_struct_cast (cognitive 21): DefaultPhysicalExprAdapterRewriter::try_narrow_struct_cast has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5, loops 1, 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":"datafusion/physical-expr-adapter/src/schema_rewriter.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff341a02c3f0b9c7950beb50e1ee8eeae681479815bdd6de258eaa37cddab8f7"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::is_custom_sort_pushdown_valid (cognitive 21): datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::is_custom_sort_pushdown_valid has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"e697f70578c3c7d1ef9ab3cfbfeedc37dc58f6019991d0396feb7ed2b8591dc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Aggregating::handle_stage (cognitive 21): Aggregating::handle_stage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/clustered_final_stream.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a202f54e41ffb2d09dafbdcfa2bc081d3f24e5a34cd0a838d153004a671d2dc"}},{"ruleId":"D2","level":"warning","message":{"text":"IndentVisitor::pre_visit (cognitive 21): IndentVisitor::pre_visit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4842730fbf4952ed09eb43fb86cc0ec5faee86b157fbb15205d81a1ee9a3b0"}},{"ruleId":"D2","level":"warning","message":{"text":"PartitionedTopKDenseRank::emit (cognitive 21): PartitionedTopKDenseRank::emit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (10 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"143f8571aec077c5b3cab30c8c010206150dbc03d1f2207eed47e16b052e173f"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::hash_join::exec::array_map_key_range (cognitive 21): datafusion_physical_plan::joins::hash_join::exec::array_map_key_range has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 3 (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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b5c94a309d399429e754e42ad4ce1d58a9baf46927c0b503393d12b4bbe369"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::hash_join::not_in::mark_null_candidates_for_probe_batch (cognitive 21): datafusion_physical_plan::joins::hash_join::not_in::mark_null_candidates_for_probe_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9, match/switch 5 (9 pts), loops 1 (2 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":"datafusion/physical-plan/src/joins/hash_join/not_in.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3d3205e7f6e39b9fd06af0204806d6d3f7ee106f0b855ede9f84865e60e4f4"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::utils::build_batch_from_indices (cognitive 21): datafusion_physical_plan::joins::utils::build_batch_from_indices has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b508b9e57f860226efdb6a64039d680ba92bac3da560adfa60ffd20ca4dcdd6"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_proto::logical_plan::to_proto::serialize_expr (cognitive 21): datafusion_proto::logical_plan::to_proto::serialize_expr has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 4 (7 pts), loops 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":"datafusion/proto/src/logical_plan/to_proto.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"169c6be0f3a27ab287916bfff56c732045466a4fd8007ece652a094cd83cf3ad"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::sql_compound_field_access_to_expr (cognitive 21): SqlToRel::sql_compound_field_access_to_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (9 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/mod.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad43ee8128e1a3360ba14678a2d956d4cf1226189442adafd37ba5197f93650"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::explain_to_plan (cognitive 21): SqlToRel::explain_to_plan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/statement.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"d148371b02bbcf3caf940f9ed34d0f0d7fd29b639bf28ea75aeb8da92db0d508"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_substrait::logical_plan::consumer::expr::subquery::from_subquery (cognitive 21): datafusion_substrait::logical_plan::consumer::expr::subquery::from_subquery has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (12 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":"datafusion/substrait/src/logical_plan/consumer/expr/subquery.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf62cd8d6fb6d09089d4f69485e5d7f3fd7eee235cc515c149cb65d8829e1624"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintOptions::write_output (cognitive 21): PrintOptions::write_output has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (9 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion-cli/src/print_options.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8360a8e41eb82dca9f2a34a79946ad66b93e5915e85f2a2497345f4e308667"}},{"ruleId":"D2","level":"warning","message":{"text":"ListingTable::scan_with_args_inner (cognitive 20): ListingTable::scan_with_args_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3 (4 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":"datafusion/catalog-listing/src/table.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aec96488e558c6c1fd1be7e568381b161f2a18495330398d61fc983f80d73d"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeType::fmt (cognitive 20): NativeType::fmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 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":"datafusion/common/src/types/native.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd3db27a86ca46dcbd0ff24f153bf7f518907e277dda13d4af3e378d4d669c1"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::nested_struct::compact_list_view_values (cognitive 20): datafusion_common::nested_struct::compact_list_view_values has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/nested_struct.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8a30a50b2002036f47e3621b7cf2322aa5e762433592ee7a98e91e8235a942"}},{"ruleId":"D2","level":"warning","message":{"text":"FileScanConfig::rebuild_with_source (cognitive 20): FileScanConfig::rebuild_with_source has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/file_scan_config/sort_pushdown.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36d1fec4f86a6626a3ccb387bc820902ef44f913851b3e51deae770a53aae64"}},{"ruleId":"D2","level":"warning","message":{"text":"RowGroupsPrunedParquetOpen::build_stream (cognitive 20): RowGroupsPrunedParquetOpen::build_stream has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3, 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":"datafusion/datasource-parquet/src/opener/mod.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cec40227715875de206b7b8ee197164c37e8593930a06b455e9635c550dc679"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_datasource_parquet::projection_read_plan::build_read_plan_with_cast_clipping (cognitive 20): datafusion_datasource_parquet::projection_read_plan::build_read_plan_with_cast_clipping has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4, match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/projection_read_plan.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7292ba15879afa2e197651562f768f261c46eb24fef4024d031382d5143f47"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_expr::expr_rewriter::guarantees::rewrite_between (cognitive 20): datafusion_expr::expr_rewriter::guarantees::rewrite_between has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_rewriter/guarantees.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f0a6e57667974a8b000d7ca027590037e9c01e686d085bdeefdf0c05f63c67"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_expr::logical_plan::builder::recursive_type_can_be_coerced (cognitive 20): datafusion_expr::logical_plan::builder::recursive_type_can_be_coerced has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, 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":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3a02cbac35d8c9c9ca2913d7720a1bc153ad81b01fad2e7d85b2fb841e08d3"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_expr::type_coercion::functions::value_fields_with_higher_order_udf (cognitive 20): datafusion_expr::type_coercion::functions::value_fields_with_higher_order_udf has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 4 (8 pts), loops 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":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b35e252f576aadeafab63b0a28e9135ede948ccb5bf9c4c7ddea46b7bdcc6d"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::core::getfield::simplify_get_field_over_struct_constructor (cognitive 20): datafusion_functions::core::getfield::simplify_get_field_over_struct_constructor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/core/getfield.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba181e7ab75b7eb634300a35f14022f3c1bb5a5784f52404a71b3b7087a6b224"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::datetime::date_bin::date_bin_impl (cognitive 20): datafusion_functions::datetime::date_bin::date_bin_impl has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 6 (9 pts), boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/date_bin.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff71fc5d1317951a2d0f308a4031f71d3269c343fc2d946d2960e3030783d0d"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::string::repeat::repeat_impl (cognitive 20): datafusion_functions::string::repeat::repeat_impl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts) (nesting depth added 9). Of this number, 17 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":"datafusion/functions/src/string/repeat.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdda53ede393462db7db8893bfae1eb76cf9a9cea23a8d43d71592f5177b22c"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::decorrelate::filter_exprs_evaluation_result_on_empty_batch (cognitive 20): datafusion_optimizer::decorrelate::filter_exprs_evaluation_result_on_empty_batch has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 6 (7 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"311e896a994e581b1449082d0b9a16cb58040dc5da72766a04046bf4fea1d20d"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::simplify_expressions::linear_aggregates::rewrite_multiple_linear_aggregates (cognitive 20): datafusion_optimizer::simplify_expressions::linear_aggregates::rewrite_multiple_linear_aggregates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 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":"datafusion/optimizer/src/simplify_expressions/linear_aggregates.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28a77e90b1036c072a49d2fc8969deee9206426d168e1a6bea8aede718d03c6"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::simplify_expressions::regex::anchored_alternation_to_exprs (cognitive 20): datafusion_optimizer::simplify_expressions::regex::anchored_alternation_to_exprs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/regex.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfb0ecc05a77ceaee138d157047d0b6f69cf0bfbc69861112b922d393d7e564"}},{"ruleId":"D2","level":"warning","message":{"text":"SortKeyWalk::pin_key (cognitive 20): SortKeyWalk::pin_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/properties/walk.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"977b1774b5d7d2370e0050cbc92a6e91a87e9ebb5e62e0bead69387fb6fd50f4"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeRenderVisitor::render_bottom_layer (cognitive 20): TreeRenderVisitor::render_bottom_layer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, 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":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"566c86833192d4e0778e097874050487ff98a9e54295734e6e02f49767c35e41"}},{"ruleId":"D2","level":"warning","message":{"text":"NestedLoopJoinStream::handle_emit_global_right_unmatched (cognitive 20): NestedLoopJoinStream::handle_emit_global_right_unmatched has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 5 (9 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":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":3197}}}],"partialFingerprints":{"codehealthFindingId/v1":"763fe1ffa9106da3eee496dcbe8a424f20a561e0730cc89e64101c4aed7ac70b"}},{"ruleId":"D2","level":"warning","message":{"text":"NestedLoopJoinStream::process_left_range_join (cognitive 20): NestedLoopJoinStream::process_left_range_join has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":3438}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e6592518b7ffa47ec0fc52a99eeebc76630f9ae6d752ea8f54c0a8416e5cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"RepartitionExecState::consume_input_streams (cognitive 20): RepartitionExecState::consume_input_streams has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3 (5 pts), match/switch 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/repartition/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be0ba8994c32833273af5e476fb1585e3c1879c5ab12b6e2942ee02829ed002"}},{"ruleId":"D2","level":"warning","message":{"text":"PerPartitionStream::poll_next_inner (cognitive 20): PerPartitionStream::poll_next_inner has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 1 (4 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/repartition/mod.rs"},"region":{"startLine":2537}}}],"partialFingerprints":{"codehealthFindingId/v1":"82facb76865c5f228ed62536be7fae06ee5c6a34740f87c9675168db21e909af"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::filter::collect_equality_columns (cognitive 20): datafusion_physical_plan::filter::collect_equality_columns has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5924050d7eaf9090c269911c5ad59201dcf78f4367e0b34efc8cd9c4b93b0d"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::join_hash_map::get_matched_indices (cognitive 20): datafusion_physical_plan::joins::join_hash_map::get_matched_indices has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/join_hash_map.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ad90c97a26b11d5ecfaad7d720ba3f888524fe86a6a6d105e18e11a9a55113"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_sql::unparser::utils::try_transform_to_simple_table_scan_with_filters (cognitive 20): datafusion_sql::unparser::utils::try_transform_to_simple_table_scan_with_filters has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/utils.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3b4979180adf625b38927138fa4c037d619ae543e14fb4f6805f42764ff6dd"}},{"ruleId":"D2","level":"warning","message":{"text":"download-python-wheels.main (cognitive 20): download-python-wheels.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev/release/download-python-wheels.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"928d086bc2d45b3ed787bbf9843bf8d47040030b354e4e37fc40c83b32b5d28e"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_catalog::memory::table::update_rows (cognitive 19): datafusion_catalog::memory::table::update_rows has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 2 (6 pts), loops 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":"datafusion/catalog/src/memory/table.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52a10d5f3b77f870506aa306dd530ef55170ab946efb0cc08e256cbb8caa741"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::error::closest_valid_field (cognitive 19): datafusion_common::error::closest_valid_field has cognitive complexity 19 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (6 pts), boolean chains 5 (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":"datafusion/common/src/error.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c18d192ec78e6027066f9c4f7b7ac2ec71e50f6da913f17d53d00c953ae7b0d"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::nested_struct::validate_map_key_data_type (cognitive 19): datafusion_common::nested_struct::validate_map_key_data_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/nested_struct.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"026ffd4d467b289cf71ba4e309d05cf226c33f3f20ed04200d6319ccc03a6d90"}},{"ruleId":"D2","level":"warning","message":{"text":"RowGroupsPrunedParquetOpen::should_load_page_index (cognitive 19): RowGroupsPrunedParquetOpen::should_load_page_index has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/opener/mod.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"9def8c5af177ac1bd66dff24e370739ee8d69634a6ec3a351579cb9483513871"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_expr_common::interval_arithmetic::satisfy_greater (cognitive 19): datafusion_expr_common::interval_arithmetic::satisfy_greater has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e137e896b73d566ac77f9bc9a7f2fcea6e748d11cb661a3963fb412ab41148"}},{"ruleId":"D2","level":"warning","message":{"text":"CoalesceFunc::invoke_with_args (cognitive 19): CoalesceFunc::invoke_with_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/core/coalesce.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd830d6ff410c23f514069bb146955c53083297a0f6ead22be2f598adb4e3c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::datetime::common::string_to_datetime_formatted (cognitive 19): datafusion_functions::datetime::common::string_to_datetime_formatted has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 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":"datafusion/functions/src/datetime/common.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"af815db9184b0fa6da70e9fd1ffbb1a692a0ba3630848c621fe6f094e3e34a18"}},{"ruleId":"D2","level":"warning","message":{"text":"PercentileContAccumulator::retract_batch (cognitive 19): PercentileContAccumulator::retract_batch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/percentile_cont.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a170912f228de580aca0ef6a726d9a679af1629f6c06d5479014ae90e045953"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_aggregate_common::merge_arrays::merge_ordered_arrays (cognitive 19): datafusion_functions_aggregate_common::merge_arrays::merge_ordered_arrays has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"datafusion/functions-aggregate-common/src/merge_arrays.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c79f68e7486277b45a88fc60e388f8a6ecad86181071ea8a93d392701873c90"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCoercionRewriter::coerce_dml (cognitive 19): TypeCoercionRewriter::coerce_dml has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/analyzer/type_coercion.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6641f766f0d3ddcd6cfc81655780dc6057e4af958a504fbfb7f2ff53553f6c6"}},{"ruleId":"D2","level":"warning","message":{"text":"DictionaryGroupValuesColumn::take_n (cognitive 19): DictionaryGroupValuesColumn::take_n has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/dictionary.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"292c9cc537137a7520da03071ae5328268c8b95f60dec081a98b000babdb360e"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupValuesColumn::scalarized_equal_to_remaining (cognitive 19): GroupValuesColumn::scalarized_equal_to_remaining has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 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":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/mod.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf762a0cc2007e3094bad18e969d7b80f2e585539f52b08a54bade01430f990"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupedTopKAggregateStream::poll_next (cognitive 19): GroupedTopKAggregateStream::poll_next has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/grouped_topk_stream.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ea5a987ecc3d8ad982f7a136fcccf798eb1df2bfa704f9cf733db4df33da80"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregateExec::estimate_num_rows (cognitive 19): AggregateExec::estimate_num_rows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cec2e13a6c13f932bbee05c28ce4fb351e1998db23920717ad9df5b1c7afc2b"}},{"ruleId":"D2","level":"warning","message":{"text":"UnmarkedPairs::scope_matches (cognitive 19): UnmarkedPairs::scope_matches has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (6 pts), loops 1 (2 pts), boolean chains 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":"datafusion/physical-plan/src/joins/hash_join/not_in.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ffeceb3ef1b8d71c963afcbd20cdf90a744613ad85d803faf0928477fc2ce7"}},{"ruleId":"D2","level":"warning","message":{"text":"RecvFuture::poll (cognitive 19): RecvFuture::poll has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/repartition/distributor_channels.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5b163d93ea2d43b19ca39c1d4a8092031f195553b4aca0d85520d33555412f"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::utils::estimate_join_null_counts (cognitive 19): datafusion_physical_plan::joins::utils::estimate_join_null_counts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c4f0a71dfdf55c68cd6544d0e35c113f98d1c6d8efd7af8a394dbf4543c0a2"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::projection::try_collapse_projection_chain (cognitive 19): datafusion_physical_plan::projection::try_collapse_projection_chain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/projection.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91ce8e5f38f75144c56d9009b410cdcb9e8483f36644ba51e3fb1242b368be5"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_pruning::pruning_predicate::build_compact_in_list_expr (cognitive 19): datafusion_pruning::pruning_predicate::build_compact_in_list_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 3 (5 pts), boolean chains 2, 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":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e034d04453439f9faf4505bf3d53b605d52538897c088461a095b6ede5169726"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::aggregate (cognitive 19): SqlToRel::aggregate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 2 (4 pts), match/switch 2 (4 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":"datafusion/sql/src/select.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ac2d4533ad9e32e00a613c4a0afdfb3de132b5518e3d2d575256c4e5122cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"Unparser::asof_join_to_sql (cognitive 19): Unparser::asof_join_to_sql has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17 (19 pts) (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":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fbfaf3fc7c46e33da47ec3a318717c94aa5540b083e23c8979398d9fdd70a3"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_sqllogictest::util::df_value_validator (cognitive 19): datafusion_sqllogictest::util::df_value_validator 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":"datafusion/sqllogictest/src/util.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec1f1726a6992e409c8c5b937c20510545b508801d3530fbad264863cbc4fef"}},{"ruleId":"D2","level":"warning","message":{"text":"draft_inactive_prs.run (cognitive 19): draft_inactive_prs.run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal 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":"ci/scripts/draft_inactive_prs.cjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4884c40d82887b0b940242c1a9eaab09b24322bb785f8ffaee07600247aa38"}},{"ruleId":"D2","level":"warning","message":{"text":"InformationSchemaConfig::add_tables (cognitive 18): InformationSchemaConfig::add_tables 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":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"b285b5f6e9f2c9a881d75cdd82878042265ca5cab9f49d05ff7f43794b2e77c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Statistics::with_fetch (cognitive 18): Statistics::with_fetch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 5 (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":"datafusion/common/src/stats.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"8026266f68a7a1c31b571b00648234935a70313083cf142e5a330d7d727fecb0"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSinkConfig::serialize (cognitive 18): FileSinkConfig::serialize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-models/src/generated/pbjson.rs"},"region":{"startLine":8039}}}],"partialFingerprints":{"codehealthFindingId/v1":"e617033e90f918de6c8101e12d752bd0bb6c0e8764840c9ccee396a271c65943"}},{"ruleId":"D2","level":"warning","message":{"text":"AvroFileSink::spawn_writer_tasks_and_join (cognitive 18): AvroFileSink::spawn_writer_tasks_and_join has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (5 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-avro/src/file_format.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f42e9d4d1cc212a0545c3da82fec73942d60f8420c1d385496b03ec4c2dd3b"}},{"ruleId":"D2","level":"warning","message":{"text":"PredicateBoundsEvaluator::evaluate_bounds (cognitive 18): PredicateBoundsEvaluator::evaluate_bounds has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 4 (6 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/predicate_bounds.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff02298cd252902838d7ee45253956bb285f979e7936be59cefb5765c075e1b4"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::string::concat::simplify_concat (cognitive 18): datafusion_functions::string::concat::simplify_concat has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (6 pts), loops 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":"datafusion/functions/src/string/concat.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8deed0adb7e5e674e0a56439fb97c2c3b9060cf8e56a63ae7df57ad424a0e149"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::utils::map_lookup (cognitive 18): datafusion_functions::utils::map_lookup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, boolean chains 4, match/switch 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":"datafusion/functions/src/utils.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"82976a294f5cae187a9eb18fdd0aa0fc5149b44a445e4af5b40fc61c71c27923"}},{"ruleId":"D2","level":"warning","message":{"text":"FirstLastGroupsAccumulator::get_filtered_extreme_of_each_group (cognitive 18): FirstLastGroupsAccumulator::get_filtered_extreme_of_each_group has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 7, 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":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32af2f5298a86eeadb9bbd83712e0fd816326a13b6c03de117bc10b52448799"}},{"ruleId":"D2","level":"warning","message":{"text":"Range::gen_range_date (cognitive 18): Range::gen_range_date has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, 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":"datafusion/functions-nested/src/range.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"5513d2af4650da4300162cce8ab6697736ab74944ea148f4ee1ce34f83ef8e12"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::extract::compute_slice_plan (cognitive 18): datafusion_functions_nested::extract::compute_slice_plan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 2 (5 pts), boolean chains 4 (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":"datafusion/functions-nested/src/extract.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2039669cee5b115258e153934da7e5e0c46f9b2f83fab432ed99bd1b436f61"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::position::array_position_scalar (cognitive 18): datafusion_functions_nested::position::array_position_scalar has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 5 (8 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":"datafusion/functions-nested/src/position.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1174f738a041618c56708b15105a99f29868d26ef09828ae65de4b932c75888"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::string::string_to_array_column_args (cognitive 18): datafusion_functions_nested::string::string_to_array_column_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (8 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/string.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfdfe232216657677e4f3971675dd03f596d36e9be78b7d915954861ce5d79c"}},{"ruleId":"D2","level":"warning","message":{"text":"EliminateGroupByConstant::rewrite (cognitive 18): EliminateGroupByConstant::rewrite has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/eliminate_group_by_constant.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"226240bc01c319fd0cf31ebce1303a5c46c66422b95f70878ccea54b43f176ed"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::push_down_filter::infer_join_predicates_impl (cognitive 18): datafusion_optimizer::push_down_filter::infer_join_predicates_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf1da4a78ddedd4d6a206fdb86c89a496ebd9a3b08e94a20f0dc2e4f348ed0c"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectionMapping::try_new (cognitive 18): ProjectionMapping::try_new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (5 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":"datafusion/physical-expr/src/projection.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f469cabbe758d06f9140ecc409662710f26d518215c516d8b17ee35ba731f286"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_expr_common::datum::compare_op_for_nested (cognitive 18): datafusion_physical_expr_common::datum::compare_op_for_nested has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (11 pts), boolean chains 4, if/else 3 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/datum.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdab82c2b5641dc0680696df8df022216315b8a8864f95e4e70f066ef356a29"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_sorting::remove_corresponding_sort_from_sub_plan (cognitive 18): datafusion_physical_optimizer::ensure_requirements::enforce_sorting::remove_corresponding_sort_from_sub_plan 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/mod.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"423a18d842b6c645a0f583f1ba47c05bc3e3c27fbf711daf64bce74cfd6dc9b7"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::join_selection::hash_join_convert_symmetric_subrule (cognitive 18): datafusion_physical_optimizer::join_selection::hash_join_convert_symmetric_subrule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/join_selection.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f3bf349e6f46bd8133db03d7268df0032875b2da133f7e0bf653fe98e09e54"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupValuesColumn::scalarized_intern (cognitive 18): GroupValuesColumn::scalarized_intern has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"2749ee2df3da9102ecb9fc3fc0bf4d89436141a68c3f0fc1283232eb2851574a"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeRenderVisitor::render_top_layer (cognitive 18): TreeRenderVisitor::render_top_layer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"7070f50180448b560344f2e1b1e78230f8b7172a717c5f2715487b26cebfcb94"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterExec::handle_child_pushdown_result (cognitive 18): FilterExec::handle_child_pushdown_result has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 7 (8 pts), boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dba78b785147dd393da87dc88a46fc21c9ba676b5ca806dbaa3111ee68108d4"}},{"ruleId":"D2","level":"warning","message":{"text":"SpillPoolReader::poll_next (cognitive 18): SpillPoolReader::poll_next has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/spill/spill_pool.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea766f3dcf3b92aa874e5019e167ff13a19bbf3da1268a64b67e8d01b9fc284"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedWindowAggStream::prune_partition_batches (cognitive 18): BoundedWindowAggStream::prune_partition_batches has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 3 (7 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b3462b50ef02599b2108cb78f34e0dfccab0bea50786bac4d090b744cc4309"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::filter::like_selectivity (cognitive 18): datafusion_physical_plan::filter::like_selectivity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 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":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec487ecee415349185b8779dc723b457696e2cbf6bc03938897c3a5a95248b7"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::set_statement_to_plan (cognitive 18): SqlToRel::set_statement_to_plan has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/statement.rs"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cdf4b91fd3943b2f50fb60d5f3b09741ca8fb22cb93cf3b1e8de710f6b9a8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Unparser::try_projection_unnest_as_lateral_flatten (cognitive 18): Unparser::try_projection_unnest_as_lateral_flatten has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 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":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a494d40649eb682fa6d482326d1561270c488cadc0ff38998693e39c54244b"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_substrait::logical_plan::consumer::plan::from_substrait_plan_with_consumer (cognitive 18): datafusion_substrait::logical_plan::consumer::plan::from_substrait_plan_with_consumer has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (8 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":"datafusion/substrait/src/logical_plan/consumer/plan.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69f84ed8e66b3c8b940881a0f114d8793289a210e7f9500e95c23bbd6bfc18e"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_cli::object_storage::get_s3_object_store_builder_inner (cognitive 18): datafusion_cli::object_storage::get_s3_object_store_builder_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 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":"datafusion-cli/src/object_storage.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"018f005d2bd84da0a57f2263e9abd91d7d81a4cf5d529ca946c7a09eca8968f0"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::metadata::coerced_fields_metadata (cognitive 17): datafusion_common::metadata::coerced_fields_metadata has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/metadata.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f802c4712cb8813e54410e2ed8f866cba16ac3da76f8610fcfe4c7ed8d3d773"}},{"ruleId":"D2","level":"warning","message":{"text":"MinMaxStatistics::new_from_files (cognitive 17): MinMaxStatistics::new_from_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/statistics.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8079f7e56013f71492849a1595e0719371a88d77a5480763c4f3fd64b5aa1ad1"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_datasource_parquet::page_filter::limit_pruned_plan (cognitive 17): datafusion_datasource_parquet::page_filter::limit_pruned_plan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/page_filter.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfabc401b3f59b6918b866c72846484c53fb8a10cfae382cce482791b3f1c13a"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_expr_common::casts::is_exact_cast_safe (cognitive 17): datafusion_expr_common::casts::is_exact_cast_safe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/casts.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfefad56554937f9c8a6991a74241d87258c29d43189928c12979b8bf00e487"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::string::chr::chr_array (cognitive 17): datafusion_functions::string::chr::chr_array has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/chr.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e915bba84d24b592c93a3ec741507323416e9d239492ae8ccf88fd2d8b2ca8f0"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderSensitiveArrayAggAccumulator::store_batch (cognitive 17): OrderSensitiveArrayAggAccumulator::store_batch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb86d37688051825af8e635408c1d45e0aeacf299389408870d8a4bc54cb99a"}},{"ruleId":"D2","level":"warning","message":{"text":"MinMaxBytesState::update_batch (cognitive 17): MinMaxBytesState::update_batch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/min_max/min_max_bytes.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab33bc9ecb8f51a155cff5895dd6e9b8c405855e812a2cfddf3f3d545ebb77a2"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterNullJoinKeys::rewrite (cognitive 17): FilterNullJoinKeys::rewrite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, loops 1 (2 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":"datafusion/optimizer/src/filter_null_join_keys.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"470084e2e9a4287d248c76d435347b53c726473be88b8cc785e8d2a58bc25cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::analyzer::type_coercion::coerce_window_frame (cognitive 17): datafusion_optimizer::analyzer::type_coercion::coerce_window_frame has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/analyzer/type_coercion.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c71c7651d516501ee6a899a5a4a550cfd773f4baa0696fe931ecf820589dcbb"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregateFunctionExpr::reverse_expr_inner (cognitive 17): AggregateFunctionExpr::reverse_expr_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"datafusion/physical-expr/src/aggregate.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ee5601899a66746e61c408a476e8849415ef372d32ab956d64c33f9f70ed27"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprStatisticsGraph::propagate_statistics (cognitive 17): ExprStatisticsGraph::propagate_statistics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 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":"datafusion/physical-expr/src/statistics/stats_solver.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbdcd00bdfc54756db00227b477d2424b6d8b548ae9c125344555fc6ed88a70"}},{"ruleId":"D2","level":"warning","message":{"text":"TopKAggregation::transform_sort (cognitive 17): TopKAggregation::transform_sort has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/topk_aggregation.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8298866a45f2eee8827de10627852dd47d8ac82bb04c91017a1563557dc72b"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_sorting::remove_bottleneck_in_subplan_impl (cognitive 17): datafusion_physical_optimizer::ensure_requirements::enforce_sorting::remove_bottleneck_in_subplan_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/mod.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d51752d8bb4166c2e4e440c948a7abc29774990d29773d2546df0e8c2a75648"}},{"ruleId":"D2","level":"warning","message":{"text":"HashJoinStream::process_probe_batch (cognitive 17): HashJoinStream::process_probe_batch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, match/switch 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/stream.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"053374194c0812bfea00e42d86521b3f7204e48cb4627e7ec942f95208f531a2"}},{"ruleId":"D2","level":"warning","message":{"text":"NestedLoopJoinStream::handle_emit_left_unmatched_memory_limited (cognitive 17): NestedLoopJoinStream::handle_emit_left_unmatched_memory_limited has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 3, boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":3108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35c89d79fcd0349af8340e151117c3c6f111759ef89cd455bac3bfe9b37a594"}},{"ruleId":"D2","level":"warning","message":{"text":"BitwiseSortMergeJoinStream::buffer_inner_key_group (cognitive 17): BitwiseSortMergeJoinStream::buffer_inner_key_group has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b986beb60c655afd77becf6c65b196906429e6c4acd3911b6d5cb91551f82a"}},{"ruleId":"D2","level":"warning","message":{"text":"BitwiseSortMergeJoinStream::process_key_match_with_filter (cognitive 17): BitwiseSortMergeJoinStream::process_key_match_with_filter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 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":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"be052cf6b09aa831b1d9b07782e6be0ee93d84c7cc1019cfaa66d8d76cc78c07"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalSortIterator::next (cognitive 17): IncrementalSortIterator::next has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 3 (5 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/stream.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"16346f837c7f946dd3cb9a944eefb97e47e5f501eccdb6507a60988935b5074b"}},{"ruleId":"D2","level":"warning","message":{"text":"UnnestStream::poll_next_impl (cognitive 17): UnnestStream::poll_next_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/unnest.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d0014605a2981faa50ee06ff6f6dcd4d39f5ef5da7b479368a1d9544a0e5af"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_plan::joins::utils::estimate_disjoint_inputs (cognitive 17): datafusion_physical_plan::joins::utils::estimate_disjoint_inputs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, 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":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8909e72bf0de052a66055bec7cff13c06a0147e0d422149f8f4ea307de7bf93"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::create_default_relation (cognitive 17): SqlToRel::create_default_relation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/relation/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4f02a947902f37c1e2daa07ddc6483dae692f4bc4b396b39fb71f27a06592d"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::rewrite_unnest_expr_groups (cognitive 17): SqlToRel::rewrite_unnest_expr_groups has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/select.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc237df11a32ec5ef5cda33af436096bd48187f21c8e2f769d52d550078790c4"}},{"ruleId":"D2","level":"warning","message":{"text":"DerivedRelationBuilder::build (cognitive 17): DerivedRelationBuilder::build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/ast.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"268ec72080acc6b12b04629088bcedeea34efe2ff3ad85ac1f77071e6aa08441"}},{"ruleId":"D2","level":"warning","message":{"text":"Unparser::interval_scalar_to_sql (cognitive 17): Unparser::interval_scalar_to_sql has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (5 pts), boolean chains 2 (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":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da78180c56ee433ee02709b5a82e1cfd020e75781f7608f262f21da4751e3ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Unparser::peel_to_unnest_with_modifiers (cognitive 17): Unparser::peel_to_unnest_with_modifiers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, match/switch 2 (3 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":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c22a366ed40b412634095d993f4311e9307013e95d74815e1795172d41bf39"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_sql::utils::check_columns_satisfy_exprs (cognitive 17): datafusion_sql::utils::check_columns_satisfy_exprs has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (14 pts), match/switch 2 (3 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/utils.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1cb034f650a4cc1df01169bbf150be6b1ee69d547a472be6fac483f5bb2843"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_sqllogictest::bin::sqllogictests::run_file_in_runner (cognitive 17): datafusion_sqllogictest::bin::sqllogictests::run_file_in_runner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sqllogictest/bin/sqllogictests.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad954768de211e763a5fbd961a85f7fdf1ec6a54159fddac081ca8a3c5d1f241"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_cli::main_inner (cognitive 17): datafusion_cli::main_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 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":"datafusion-cli/src/main.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"755b4d5c11cc18289e8afba11b09384ea1ac296d1895c3a9f274eac7e8b05162"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-changelog.generate_changelog (cognitive 17): generate-changelog.generate_changelog has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, 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":"dev/release/generate-changelog.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c740094639dde464b21ca00c11c451c2fa32915ddcca91dc5e4c748e8aff55"}},{"ruleId":"D2","level":"warning","message":{"text":"Precision::from (cognitive 16): Precision::from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Precision::from) 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":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"4734cc3f974a97de73f89de22eaba8118cfe19ff8a222ddd53e4ba7586285efc"}},{"ruleId":"D2","level":"warning","message":{"text":"Precision::from (cognitive 16): Precision::from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Precision::from) 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":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"713cd2a344074e7f30561bf1e4870195764bb239f9779c9340d1e056427a79c6"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferIdMap::decrement (cognitive 16): BufferIdMap::decrement 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":"datafusion/common/src/utils/memory.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8eddeb597dacfc2dcf48a23cd9c0dbd5d83a4b45e5231585c5e4de92f4b6e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ParquetCdcOptions::deserialize (cognitive 16): ParquetCdcOptions::deserialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (JsonOptions::deserialize) 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":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":5921}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e135ecc0530bc58465b14cef24a31cd6eddade0258cba6a2d43793bc280663"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonOptions::deserialize (cognitive 16): JsonOptions::deserialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ParquetCdcOptions::deserialize) 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":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":5143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abdf0f520874b8013d0b515502f5a48e5b2d64ad89b08a785d1a787c641608e"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::hash_utils::hash_array (cognitive 16): datafusion_common::hash_utils::hash_array has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5 (6 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ce97e16d517f0e14972678be84e889696bc5e6b5d1eec49f5f1283473b3471"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::hash_utils::hash_map_array (cognitive 16): datafusion_common::hash_utils::hash_map_array has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (5 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 3 other methods here (datafusion_common::hash_utils::hash_list_array, datafusion_common::hash_utils::hash_list_view_array, datafusion_common::hash_utils::hash_fixed_list_array) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1421a71ab162ef9964c0ace593338d5d56e133e3cc6bbd1b3cb025b776c4ad"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::hash_utils::hash_list_array (cognitive 16): datafusion_common::hash_utils::hash_list_array has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (5 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 3 other methods here (datafusion_common::hash_utils::hash_map_array, datafusion_common::hash_utils::hash_list_view_array, datafusion_common::hash_utils::hash_fixed_list_array) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"276eaf918fd0048b80e21dca00133b37eea78c5468f5d61ed5348f59a6e6f68a"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::hash_utils::hash_list_view_array (cognitive 16): datafusion_common::hash_utils::hash_list_view_array has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (5 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 3 other methods here (datafusion_common::hash_utils::hash_map_array, datafusion_common::hash_utils::hash_list_array, datafusion_common::hash_utils::hash_fixed_list_array) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a0d6d7f19db576e55992bc1b2732df228c63ff84d9195bcfc23e247950df19"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::hash_utils::hash_fixed_list_array (cognitive 16): datafusion_common::hash_utils::hash_fixed_list_array has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (5 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 3 other methods here (datafusion_common::hash_utils::hash_map_array, datafusion_common::hash_utils::hash_list_array, datafusion_common::hash_utils::hash_list_view_array) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a073fad321a78728171362bf837a70fcf55aafae74e664e9c9fa4dd2958a46"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::hash_utils::build_hasher::hash_array_primitive_with_hasher (cognitive 16): datafusion_common::hash_utils::build_hasher::hash_array_primitive_with_hasher has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5 (6 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (datafusion_common::hash_utils::build_hasher::hash_array_with_hasher) 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":"datafusion/common/src/hash_utils/build_hasher.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec68ea4246a9c52c2412485a44ce67a2a711a8f34a7d05dd65a0dfea5c512464"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_common::hash_utils::build_hasher::hash_array_with_hasher (cognitive 16): datafusion_common::hash_utils::build_hasher::hash_array_with_hasher has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5 (6 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (datafusion_common::hash_utils::build_hasher::hash_array_primitive_with_hasher) 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":"datafusion/common/src/hash_utils/build_hasher.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0605707864af7119e0682dbb9817fcc2af38a8420b8dc6c392f56482979f9afd"}},{"ruleId":"D2","level":"warning","message":{"text":"BloomFilterStatistics::check_scalar (cognitive 16): BloomFilterStatistics::check_scalar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/bloom_filter.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e45d554024c579608c6158db69a767199db7e063a59210eb17c68345775c19"}},{"ruleId":"D2","level":"warning","message":{"text":"InformationSchemaColumnsBuilder::add_column (cognitive 16): InformationSchemaColumnsBuilder::add_column has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, 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":"datafusion/expr/src/logical_plan/information_schema.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"960e116053a090670b8e2055c028ece7a6fe08f3f27349e878fa5428dfef4422"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalPlan::max_rows (cognitive 16): LogicalPlan::max_rows has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (6 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5a873265a9ab5e45dd0a845b4812b23b7d9036e8eb1a22fbca0a727398002a"}},{"ruleId":"D2","level":"warning","message":{"text":"Partitioning::deserialize (cognitive 16): Partitioning::deserialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-models/src/generated/pbjson.rs"},"region":{"startLine":18417}}}],"partialFingerprints":{"codehealthFindingId/v1":"2984a51cb6292acc41b8d47882080a24aabb80983035655fdc6bce2505a3f280"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryTypeCoercer::signature_inner (cognitive 16): BinaryTypeCoercer::signature_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (3 pts), boolean chains 1 (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":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6569dc67bedbabbcf00c75874f471d52b651a749c6d02a679af667cbe5cef4"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions::unicode::pad::pad_scalar_ascii (cognitive 16): datafusion_functions::unicode::pad::pad_scalar_ascii has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), 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":"datafusion/functions/src/unicode/pad.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1166cf99f50d0aaff7279cbe5a1dc1e3790c40a0ccf2f4aeb1ee458ed2a3bd9"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayAggGroupsAccumulator::compact_retained_state (cognitive 16): ArrayAggGroupsAccumulator::compact_retained_state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3579c57580309f4020a4e3a7e2f2dcbbe4de9a35bcc7426e56c149a2b4fa8ff"}},{"ruleId":"D2","level":"warning","message":{"text":"FirstLastGroupsAccumulator::update_batch_pre_ordered (cognitive 16): FirstLastGroupsAccumulator::update_batch_pre_ordered has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"20db6c94a5c58987ec6148d6e99c284b7d5a47272258448c3b15db1ba15286f4"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_aggregate::percentile_cont::create_percentile_accumulator (cognitive 16): datafusion_functions_aggregate::percentile_cont::create_percentile_accumulator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/percentile_cont.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58ed1b10ef371d5ace288e4c2351afafc0df910ecb1c50d930c17e0a3cb808e"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_functions_nested::remove::general_remove_with_scalar (cognitive 16): datafusion_functions_nested::remove::general_remove_with_scalar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/remove.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2d9813cd25ecb2c020dece6bccb35051d40c724053a66ba0774ed2a3fb6b6a"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplaceFilterTop1::rewrite (cognitive 16): ReplaceFilterTop1::rewrite has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"datafusion/optimizer/src/replace_filter_top1.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6a72f8f6c50ac6b73af7d6c9cbcb687cd8effa5b1e92777d4acad0d2330772"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_optimizer::eliminate_cross_join::find_inner_join (cognitive 16): datafusion_optimizer::eliminate_cross_join::find_inner_join has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/eliminate_cross_join.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"213a34fc0432eb051cdae72b53ecdf25d7e8eac479569e622f96e48e53ea1668"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_expr::expressions::binary::pre_selection_scatter (cognitive 16): datafusion_physical_expr::expressions::binary::pre_selection_scatter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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":"datafusion/physical-expr/src/expressions/binary.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41cc5918d1cc402e302425cddf051d55ec60750767935f451852b9ce314bfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_expr_common::utils::scatter_bits (cognitive 16): datafusion_physical_expr_common::utils::scatter_bits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 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":"datafusion/physical-expr-common/src/utils.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e977d30b94b3a029b4488cddfdef90474afe77ca4d2c14cd9469753e5fc481f"}},{"ruleId":"D2","level":"warning","message":{"text":"TopKRepartition::optimize (cognitive 16): TopKRepartition::optimize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), 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":"datafusion/physical-optimizer/src/topk_repartition.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8123e240cbbb46b60443b68ba20179419ac4b727dc6f0c0202898bf7a1850d"}},{"ruleId":"D2","level":"warning","message":{"text":"datafusion_physical_optimizer::ensure_requirements::enforce_sorting::ensure_sorting (cognitive 16): datafusion_physical_optimizer::ensure_requirements::enforce_sorting::ensure_sorting has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/mod.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"893bac0c9f73e3e652d16f3ee2f199dff111ca6f887a9a6583147ad07feef9c0"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupedHashAggregateStream::group_aggregate_batch (cognitive 16): GroupedHashAggregateStream::group_aggregate_batch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"6687116f4dc228d34b4b61c0c882affab2f3c317149bacee54e7886f7d9e0b07"}},{"ruleId":"D2","level":"warning","message":{"text":"TopKHeap::_tree_print (cognitive 16): TopKHeap::_tree_print has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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":"datafusion/physical-plan/src/aggregates/topk/heap.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9b29e04d32d1ce75b09a9461608a93e1f5ef4cd0d80e703bf90df57a9d191a"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterExecStream::poll_next (cognitive 16): FilterExecStream::poll_next has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ae55252d8830f5c5944fc811495855f23df671e91ec1c5b6e3907a0149dad2"}},{"ruleId":"D2","level":"warning","message":{"text":"BitwiseSortMergeJoinStream::join (cognitive 16): BitwiseSortMergeJoinStream::join has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (3 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":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d286a702430c56dc899a6d490536df6b0eaf0c4f39dfb946da6f8f6686c6dd"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregateStatisticsProvider::compute_statistics (cognitive 16): AggregateStatisticsProvider::compute_statistics has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (3 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":"datafusion/physical-plan/src/operator_statistics/mod.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba131b1375d64644ede974933095062aba50f9d5084c3bdc8bfdea29941676a8"}},{"ruleId":"D2","level":"warning","message":{"text":"JoinStatisticsProvider::compute_statistics (cognitive 16): JoinStatisticsProvider::compute_statistics has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 1). 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: 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":"datafusion/physical-plan/src/operator_statistics/mod.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee469a2349058928b1e5fd21bf0da3b64875378cebfa17bc9154864b3ac1ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"RepartitionExec::try_swapping_with_projection (cognitive 16): RepartitionExec::try_swapping_with_projection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/repartition/mod.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f497c9017d36f9d1e3426501af93e9c9e9423d33485bfecc0ee949aefe1ce7e"}},{"ruleId":"D2","level":"warning","message":{"text":"StatisticsContext::try_provider_stats (cognitive 16): StatisticsContext::try_provider_stats has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/statistics.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"1825e7e7da415dcccc72be8dd8c5ddababec0aa91e8e7b96641455e3276bb2f7"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionArgs::try_new (cognitive 16): FunctionArgs::try_new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 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":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5dc64f0868917ad0cd047b53165209e9b1ac16e0f0633b57c1978393e1bf1b"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::sql_expr_to_logical_expr_internal (cognitive 16): SqlToRel::sql_expr_to_logical_expr_internal has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 2 (4 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdfe72b427d6a4f8297f0844ce0eb86508a3168d49fe9dfa7a14dc4e40abfb5"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlToRel::validate_schema_satisfies_exprs (cognitive 16): SqlToRel::validate_schema_satisfies_exprs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (5 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":"datafusion/sql/src/planner.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"5146e760c907570597a72ac122fa0e7907cbb7126e4d6d3d0a86178b87decdce"}},{"ruleId":"D2","level":"warning","message":{"text":"Unparser::reconstruct_select_statement (cognitive 16): Unparser::reconstruct_select_statement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fb5db0f0da793ca905258920facdcaafe2b64bbc9eb8a04ecb074e30d1e3ce"}},{"ruleId":"D2","level":"warning","message":{"text":"check_asf_yaml_status_checks.get_workflow_jobs (cognitive 16): check_asf_yaml_status_checks.get_workflow_jobs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 3, loops 2 (3 pts), ternaries 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":"ci/scripts/check_asf_yaml_status_checks.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e2856aafc4f282b94e3e1f0e3b2543d884ccbb116c0889272c4de0f56ffabc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlToRel.sql_statement_to_plan_with_context_impl: MethodTooLong \u2014 sql_statement_to_plan_with_context_impl runs 1024 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 924 over it, 10.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":"datafusion/sql/src/statement.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"98db6ae29a72c27fef67177355d840d861d6e64377484fa98cbfe586f8ab83a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefaultPhysicalPlanner.map_logical_node_to_physical: MethodTooLong \u2014 map_logical_node_to_physical runs 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) in one body. The bar is 100 significant lines; this is 873 over it, 9.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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"37eb8d895b0fb44bdfea842989bcb9af6e7cc3b1e031e6a1a16b278485261690"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ScalarValue: ClassTooLong \u2014 3439 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 89 methods, 15 blocks, lines 393-6255. The bar is 400 significant lines; this is 3039 over it, 8.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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef41f55ff6c4815efe0be4ff040d3efa748f10cf5a4e8a4868e9881e0b00b2db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scalar/mod.rs: FileTooLong \u2014 3928 significant 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: ScalarValue (15 blocks, 393-6255). The bar is 500 significant lines; this is 3428 over it, 7.86\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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a761d9fb44c40e8df39e50fc7ddce1c64901a6f9417b2151c39ca4b91e9d90e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Simplifier.f_up: MethodTooLong \u2014 f_up runs 773 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 673 over it, 7.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":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31f8d69fcf0f0cd98a5245b379a90b6ec9079f37106387b3bd3ca77fd3338fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Unparser.select_to_sql_recursively: MethodTooLong \u2014 select_to_sql_recursively runs 698 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 598 over it, 6.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":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aed7ed6bb819be7672585ed30a91ed52a40ac4724d767940b2bee8c9bdd3617"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logical_plan/plan.rs: FileTooLong \u2014 3132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2632 over it, 6.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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d33ac76caa5e0caaf076f1dba2be8f3c2fd315dafb19d5e53a3379438fc241"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/physical_planner.rs: FileTooLong \u2014 2581 significant 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: DefaultPhysicalPlanner (5 blocks, 165-3717). The bar is 500 significant lines; this is 2081 over it, 5.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9ff02ad4d6af2265dc627c5cc0d8d456772dd0303c66e210b97a4910745e4b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SqlToRel: TooManyMethods \u2014 147 methods, declared across 19 files: src/statement.rs (29), expr/mod.rs (28), src/select.rs (20), src/planner.rs (12), \u002B15 more file(s). The bar is 30 methods; this is 117 over it, 4.90\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/planner.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc797bcd37fae992d93f193a6bcbefdbe494352a6d0d00a66bc67ce482799b9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlToRel.sql_function_to_expr: MethodTooLong \u2014 sql_function_to_expr runs 465 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 365 over it, 4.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":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81dfb17cf11aa7015dccb8d3a503755c04a1d23b73e0af1d8a163cf5c75a10f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: joins/nested_loop_join.rs: FileTooLong \u2014 2262 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1762 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":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f33b8d69499fb4e1dfbed4e530f5bc0b72287ce3b9ce700f07ece3d34c22f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_physical_expr::planner::create_physical_expr: FunctionTooLong \u2014 datafusion_physical_expr::planner::create_physical_expr runs 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) in one body. The bar is 100 significant lines; this is 345 over it, 4.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":"datafusion/physical-expr/src/planner.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bd64e019f937c97553d9cf03511417a485cfbcdeec6e3192f51a3a3b26ba14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/statement.rs: FileTooLong \u2014 2153 significant 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: SqlToRel (220-2968). The bar is 500 significant lines; this is 1653 over it, 4.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c49e50d0ca72d13817c8bbe6b4cb8c417d135d19c38ef25c0a54985590d48f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr.rs: FileTooLong \u2014 2148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1648 over it, 4.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":"datafusion/expr/src/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a00ab7b546008ddaf41f7f67ee0637574a753ffa87cf56b703123fe573cca1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DefaultPhysicalPlanner: ClassTooLong \u2014 1714 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 5 blocks, lines 165-3717. The bar is 400 significant lines; this is 1314 over it, 4.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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6410f4a75aad61735f700c105f14ea9d48f62756ad9eeac494ebc676d25c222b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PushDownFilter.rewrite: MethodTooLong \u2014 rewrite 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":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"2481f9aec8fbe06df50c6041a6007dfe4e38ace7bb94ab43596f4aed2b1a53b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Unparser.expr_to_sql_inner: MethodTooLong \u2014 expr_to_sql_inner runs 379 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 279 over it, 3.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f96f5f31fbf890d60bbc1ac7c9f999e7ac4c676bf806720b6a2d86fa351eb6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicalPlan: ClassTooLong \u2014 1505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 48 methods, 7 blocks, lines 269-2597. The bar is 400 significant lines; this is 1105 over it, 3.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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f83e17a25cc207f912c89d0e76719024c4b16814df6083d2f17d3a4c510a781"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unparser/plan.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), about 96% of them inside a single declaration: Unparser (161-2976). The bar is 500 significant lines; this is 1374 over it, 3.75\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":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8f33190015c90db4be5f44c21541ac44f3afcdbca0cdacd0da860387424807"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalPlan.with_new_exprs: MethodTooLong \u2014 with_new_exprs runs 374 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 274 over it, 3.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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ed6748593a2321a0d1a1086fda97567e7f1253925406bba3a3021a08dafe85"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_substrait::logical_plan::consumer::expr::literal::from_substrait_literal: FunctionTooLong \u2014 datafusion_substrait::logical_plan::consumer::expr::literal::from_substrait_literal runs 370 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 270 over it, 3.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":"datafusion/substrait/src/logical_plan/consumer/expr/literal.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aeaab087960a6b02cc1d318bf6536e0c19c94d9e47d0cfc7a3f0214ef1cf185"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logical_plan/mod.rs: FileTooLong \u2014 1849 significant 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: LogicalPlanNode (468-2428). The bar is 500 significant lines; this is 1349 over it, 3.70\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":"datafusion/proto/src/logical_plan/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e0f32a7400b66985cadfafe918e5b5e3595224d12a743de2329c7be39d2c1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_proto::logical_plan::from_proto::parse_expr: FunctionTooLong \u2014 datafusion_proto::logical_plan::from_proto::parse_expr runs 369 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 269 over it, 3.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":"datafusion/proto/src/logical_plan/from_proto.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f95e9599edb0a769a225b1cd9c85bc8ea6e6d429b49ffa29e6a5cffa6e65a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: aggregates/mod.rs: FileTooLong \u2014 1808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: AggregateExec (5 blocks, 864-2848). The bar is 500 significant lines; this is 1308 over it, 3.62\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7af93d366c810872f666a74a935e3dcccd3a376b8857dea05f6a8a76c08f7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 1777 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1277 over it, 3.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9645924452b271a104097f8b4349c70ccf118249b124211c6208d655226c59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeCoercionRewriter.f_up: MethodTooLong \u2014 f_up 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":"datafusion/optimizer/src/analyzer/type_coercion.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"9728bd0e83cfd8b84ef083be1e5cd75003a536586938c9103eb997f217677929"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: joins/utils.rs: FileTooLong \u2014 1743 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 1243 over it, 3.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4de6d3d0511f5e5ae54604cfed20a62a922be8241256d752b4de169d6e2893"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hash_join/exec.rs: FileTooLong \u2014 1729 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1229 over it, 3.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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfb3517bfaeaaef585a84754bc023b047b4fdf7435d26b462d0630a5dde1ec1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_proto::logical_plan::to_proto::serialize_expr: FunctionTooLong \u2014 datafusion_proto::logical_plan::to_proto::serialize_expr runs 344 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 244 over it, 3.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":"datafusion/proto/src/logical_plan/to_proto.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6744d278238b4bd7afb023a281b57c7ffa45436a4c41b7508aed47537b87fb26"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionContext: TooManyMethods \u2014 103 methods, declared across 5 files: context/mod.rs (92), context/csv.rs (3), context/json.rs (3), context/parquet.rs (3), \u002B1 more file(s). The bar is 30 methods; this is 73 over it, 3.43\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a682914d30343707cdbfa267cdef8430c6118656eabf640f2a1c158e4138f43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlToRel.select_to_plan: MethodTooLong \u2014 select_to_plan 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":"datafusion/sql/src/select.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"719b1497f7720010790d40f26f321411f889c6a54ffd88a6a72380ad2838b2e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_expr::type_coercion::functions::get_valid_types: FunctionTooLong \u2014 datafusion_expr::type_coercion::functions::get_valid_types runs 335 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 235 over it, 3.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":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfa637753a0b018128fa53f5b21234cf3c5311e433babab1bc0da146563e764"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PgJsonVisitor.to_json_value: MethodTooLong \u2014 to_json_value 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":"datafusion/expr/src/logical_plan/display.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"171466b63bd61fe3149bf75d7d4e45149e463a16f80711e84959031eec262e2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlToRel.sql_expr_to_logical_expr_internal: MethodTooLong \u2014 sql_expr_to_logical_expr_internal runs 321 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 221 over it, 3.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":"datafusion/sql/src/expr/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"817ea6c8ecb4fbf9337665b94ade6310728610f9494955b29d016cbde643421c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: topk/mod.rs: FileTooLong \u2014 1574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1074 over it, 3.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":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"592bb23e5c452c06d7cd290f94a74eb37a3ccaefa9757f49331d318847095ef1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalPlan.display: MethodTooLong \u2014 display runs 311 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 211 over it, 3.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":2173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbb594da8085b34c6c8c4f3dca13f7433150497f29fcd55ebdcbac5855bea72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: execution/session_state.rs: FileTooLong \u2014 1550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1050 over it, 3.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde15b9ee2dfe2e6ee9d6775c2a128bfa48bcf880ad85647a13dd05da1ba3a34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.normalize_eq: MethodTooLong \u2014 normalize_eq runs 310 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 210 over it, 3.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr.rs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1336ed75ea981aae0fe4d2a1d10c9217f39b599701388b14c8c3aa43130f5ae"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Unparser: TooManyMethods \u2014 92 methods, declared across 3 files: unparser/plan.rs (55), unparser/expr.rs (34), unparser/mod.rs (3). The bar is 30 methods; this is 62 over it, 3.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e42ac9d6c8f118023ae43bbe7f0daa711483d931dbb4e716d0a648799cfff8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logical_plan/builder.rs: FileTooLong \u2014 1499 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: LogicalPlanBuilder (4 blocks, 208-1830). The bar is 500 significant lines; this is 999 over it, 3.00\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed41bfbaff85de62bc857515d0f782bd5afb412f7d65a6dcc050f1d5c5f4352"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScalarValue: TooManyMethods \u2014 89 methods. The bar is 30 methods; this is 59 over it, 2.97\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d924581090fd13efe25529840869271d6d1f37d5aa1c51852900e62d3f527b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AggregateExec: ClassTooLong \u2014 1162 significant 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, 5 blocks, lines 864-2848. The bar is 400 significant lines; this is 762 over it, 2.91\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb2c8602dfa63127dea7ac6387508d064ab87ae1463bec109e812d583239419"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarValue.to_array_of_size: MethodTooLong \u2014 to_array_of_size runs 290 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 190 over it, 2.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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":3745}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc1232500b2ec626c674e1a445c377aaee295a8034358fd0c9ab80846d4f626"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalPlan.map_children: MethodTooLong \u2014 map_children runs 289 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 189 over it, 2.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4e4884c39e12e6611772c563d026de5da361da50df3700c1978ec3f6a1a128"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: repartition/mod.rs: FileTooLong \u2014 1413 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 913 over it, 2.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":"datafusion/physical-plan/src/repartition/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6208c21efcb515ed758dc216cda8c100deda8db708ff4d29c485664539219e89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/array_agg.rs: FileTooLong \u2014 1398 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 898 over it, 2.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36a87c154aa4c1dbae26f1e46eee2eca962def9d176bb68158052f4e54c7829"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unparser/expr.rs: FileTooLong \u2014 1381 significant 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: Unparser (89-1941). The bar is 500 significant lines; this is 881 over it, 2.76\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":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d5f039f5c1569f3d9f8e43a240b9dfc6cbb28f43b1039dc4c4050383bdb99f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Expr: ClassTooLong \u2014 1100 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 53 methods, 13 blocks, lines 314-3857. The bar is 400 significant lines; this is 700 over it, 2.75\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65cadf6c45d3c78fcc946e2d05c656773f9a6c91ab115c7871e526523c634d7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionContext: ClassTooLong \u2014 1097 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 103 methods, 6 blocks, lines 281-2238. The bar is 400 significant lines; this is 697 over it, 2.74\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25bf9e10907a793af52cc73182e5506e1caffc6c3882d5b697f448dadd0183e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StepContext.run_test: MethodTooLong \u2014 run_test runs 273 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 173 over it, 2.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":"xtask/src/ci_steps.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c37947d1454101f5c13ee7821901b1794681483c2b68caa565ccceafabdadba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_coercion/binary.rs: FileTooLong \u2014 1353 significant 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 61 free functions. The bar is 500 significant lines; this is 853 over it, 2.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":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fcaa7097734979b1fa835b226ab0534e99814b4226171e0957792a5f58e45f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_optimizer::decorrelate_predicate_subquery::build_join: FunctionTooLong \u2014 datafusion_optimizer::decorrelate_predicate_subquery::build_join runs 264 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 164 over it, 2.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate_predicate_subquery.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"b132fa24a05f2694f7bf66d3ea11ebfe36d034daf929cf1f7b226c82d2949ca5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: simplify_expressions/expr_simplifier.rs: FileTooLong \u2014 1309 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: Simplifier (3 blocks, 821-2120). The bar is 500 significant lines; this is 809 over it, 2.62\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a662a636ff3e0771fecec4186bc8e356c22e72bb07c7d71957c97f940c89b05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: context/mod.rs: FileTooLong \u2014 1286 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: SessionContext (6 blocks, 281-2238). The bar is 500 significant lines; this is 786 over it, 2.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"292b11c37e3060c03f76dec592b8615ac434b285ce86c489391a1fcaeb948e47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarValue.iter_to_array: MethodTooLong \u2014 iter_to_array runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 157 over it, 2.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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c52a6506d69e91009ec1ef2164d2889c9d6fff227cb34c253b96594d479cece"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarValue.try_from: MethodTooLong \u2014 try_from runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 157 over it, 2.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":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"675c325e6d8f7a7d64244505d441976e3a6f6c45cc119c600823c8b5bde0ce35"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/first_last.rs: FileTooLong \u2014 1261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 761 over it, 2.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeb3e550f492ab696aaa25cbf52cdc86a3d269ed0fa0a2d2e0ad20d3a08b639"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sorts/sort.rs: FileTooLong \u2014 1252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 752 over it, 2.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/sort.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12219debe877e7e2bd1c5a3f317bc3d6c9d9d113b921881866e788a88758d14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: opener/mod.rs: FileTooLong \u2014 1245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 745 over it, 2.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":"datafusion/datasource-parquet/src/opener/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2168cb0e38e4cbff2f4b0a98cd019524b2731e1ee6b6284e4b7aeef17bd4a0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sort_merge_join/materializing_stream.rs: FileTooLong \u2014 1240 significant 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 70% of them inside a single declaration: MaterializingSortMergeJoinStream (2 blocks, 340-2041). The bar is 500 significant lines; this is 740 over it, 2.48\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5c6a849943dd255db89962734ef5928cc485f665e445278de2f878a446131f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: joins/symmetric_hash_join.rs: FileTooLong \u2014 1239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 739 over it, 2.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/symmetric_hash_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"913a5d8bc9ade55ad2d839e47f3cc1a11e7fc4ba21a8cb612a57ba868ede339c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarValue.try_from: MethodTooLong \u2014 try_from 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":"datafusion/proto-common/src/to_proto/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc36faac5781742404a83627383b6f99119ec4c5ad5e6d81b753e8a0f4471eb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/filter.rs: FileTooLong \u2014 1231 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 731 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":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77aa4ee4346bd9570dcc7a9a43485b5bf6e4036ab210d78f235248010b580335"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PullUpCorrelatedExpr.f_up: MethodTooLong \u2014 f_up runs 245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 145 over it, 2.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04d51cec02b63ae9042644a6c9da37ad3709104e81bb38d812ac2ffa4867b35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_optimizer::optimize_projections::optimize_projections: FunctionTooLong \u2014 datafusion_optimizer::optimize_projections::optimize_projections runs 245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 145 over it, 2.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/optimize_projections/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea4fe3963938af770bfb057f7fcfaf402d02504c431eb50539c559a0dd582e2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicalPlanBuilder: ClassTooLong \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), 70 methods, 4 blocks, lines 208-1830. The bar is 400 significant lines; this is 567 over it, 2.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce8d2169502a0c3d12f857996e43ff8bc2e7e7bef40b4c5f2003037804fd524"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ensure_requirements/enforce_distribution.rs: FileTooLong \u2014 1205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 705 over it, 2.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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eec585f85d76a0fd240a2a728452f01ca630208b3cf05504a469378b98ead80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analyzer/type_coercion.rs: FileTooLong \u2014 1176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 676 over it, 2.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/analyzer/type_coercion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"394edd0b5c526b001275f640e9f3706a8becda645dddd1b85da0f91d3a7a4980"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogicalPlanBuilder: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc775c10844f8f214049b60ebdf17d156915351a612679ff9bcde19cec5209f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalPlan.map_expressions: MethodTooLong \u2014 map_expressions 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":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5be4c9dabd2e92072dd1e205140fd3a0dd6b655eeb1ef5cdb72bc1ad9bd1f37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pruning_predicate.rs: FileTooLong \u2014 1137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 637 over it, 2.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":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22b827563e9b138460afed4fa5b13ede5d651937adbea2ccc9737f3cf7c324b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/mod.rs: FileTooLong \u2014 1136 significant 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: SqlToRel (201-1499). The bar is 500 significant lines; this is 636 over it, 2.27\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":"datafusion/sql/src/expr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2239a32a248e09e32fc374050b8267447c6e2d6c72a74e9f852f14239a0630d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HashJoinExec: ClassTooLong \u2014 907 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 7 blocks, lines 840-2371. The bar is 400 significant lines; this is 507 over it, 2.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"207d62f0af870cd30d2444e0c579f6c4a4f5e88ee006f3bf75149f4131bf4264"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_substrait::logical_plan::producer::types::to_substrait_type_from_field: FunctionTooLong \u2014 datafusion_substrait::logical_plan::producer::types::to_substrait_type_from_field runs 224 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/producer/types.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d2b8679afd3ba68f6519eb7e0b6efe44133c504aea8de353fce839c04f8495"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_substrait::logical_plan::producer::expr::literal::to_substrait_literal: FunctionTooLong \u2014 datafusion_substrait::logical_plan::producer::expr::literal::to_substrait_literal 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":"datafusion/substrait/src/logical_plan/producer/expr/literal.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f929ee0b62ae6976b5970ba42e794dfa67e6d0320ab54be645401fb64ffdb7a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionState: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d105d38dcce313755a46a3fbee74c61749e50335f3d6ff60406ec59bfb94c5f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/select.rs: FileTooLong \u2014 1097 significant 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: SqlToRel (87-1628). The bar is 500 significant lines; this is 597 over it, 2.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":"datafusion/sql/src/select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaf908fd59c4c6bf3ef4fc25f191533c25d5298e05de68c6a6953cbedf97ddb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NestedLoopJoinStream: ClassTooLong \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), 26 methods, 5 blocks, lines 2103-3852. The bar is 400 significant lines; this is 477 over it, 2.19\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38a4d4e938e4e2e3aef3617bc2f037089f10c6b14afbd78ceb207960ce4803d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataFrame: TooManyMethods \u2014 65 methods, declared across 2 files: dataframe/mod.rs (64), dataframe/parquet.rs (1). The bar is 30 methods; this is 35 over it, 2.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. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e655036abb290cca5c7301ea76077232f382967a379adf28b03529d342900d53"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionStateBuilder: TooManyMethods \u2014 65 methods. The bar is 30 methods; this is 35 over it, 2.17\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd54047abc7c2897c927641b410aefb83fe672809b4f11f67a0eadac5c2f0c5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_physical_optimizer::ensure_requirements::enforce_distribution::ensure_distribution_with_stats: FunctionTooLong \u2014 datafusion_physical_optimizer::ensure_requirements::enforce_distribution::ensure_distribution_with_stats runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b0a57a723ee063929a7bc58a137877b8cb95c6fe24a4202fc12b83e1c094d5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MaterializingSortMergeJoinStream: ClassTooLong \u2014 862 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 42 methods, 2 blocks, lines 340-2041. The bar is 400 significant lines; this is 462 over it, 2.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f4163f878e6b7abc5edd83f5fc9de4b26bd6b1d675400e97a635ba26c91553"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_functions::datetime::date_bin::date_bin_impl: FunctionTooLong \u2014 datafusion_functions::datetime::date_bin::date_bin_impl runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/date_bin.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddc02baba40bd625182359d88b457956f4541092b33bccf38317edf78d0d8ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataframe/mod.rs: FileTooLong \u2014 1063 significant 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: DataFrame (2 blocks, 220-2900). The bar is 500 significant lines; this is 563 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":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f8768c7e736fc110c6b70f6f296419c899572c5597bd6648f09917622d36bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/interval_arithmetic.rs: FileTooLong \u2014 1057 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 557 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f2a2bfeb1db0849f0682b31c1493bf7f5a27a2f879029917a0c305acb26553"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: from_proto/mod.rs: FileTooLong \u2014 1057 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 557 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c763686471a83819b97a8750a271b8591d153b3cc2c21716090420916057e899"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SchemaDisplay.fmt: MethodTooLong \u2014 fmt 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":"datafusion/expr/src/expr.rs"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ecf5c1087bdf46ccc310a5c813ed0e2a18846ea870bf32e058e4bec65f6e14"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DataFrame: ClassTooLong \u2014 838 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 65 methods, 2 blocks, lines 220-2900. The bar is 400 significant lines; this is 438 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a4273e5dad44894b66f9001077ab2886120f44f8927dabb9ddc0b4edea93ff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionConfig: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.07\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/execution/src/config.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96b29ec8ef29070b46c911425984d0ff931ecf7729f8bd17e0311035e98c906"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: joins/asof_join.rs: FileTooLong \u2014 997 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 497 over it, 1.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5c141b9689801fbe6d8c7e51d84e352398165a1046d9a905eb83b37c6a6d66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/binary.rs: FileTooLong \u2014 995 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 495 over it, 1.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c642d13a7a808356747eb71342231121672597a0a8b7fe1f114edf155106c8cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hash_join/not_in.rs: FileTooLong \u2014 989 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 489 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":"datafusion/physical-plan/src/joins/hash_join/not_in.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06194d8f7b93cc3570dbe33a9dfee3965c1ffca29372d3383ea9802506495ee4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EquivalenceProperties: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/properties/mod.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b16fb62e48a19175cb7c8d84bc844f95efbf31a1087a3baa8a85cdb2e5830a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/bounded_window_agg_exec.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":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a0cf3414f482c0f82842d898040683a5d227bae84e981550b4a51e07638a2c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RowGroupsPrunedParquetOpen.build_stream: MethodTooLong \u2014 build_stream runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/opener/mod.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b11fa44e1950081771619fdbb769a598373519a6a6d9832c7d0a95b19b5d62"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_functions::regex::regexpcount::regexp_count_inner: FunctionTooLong \u2014 datafusion_functions::regex::regexpcount::regexp_count_inner runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03e2621545b693368f2e9e52a55c3931b1682e77298542527a44113b7c05c2a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Simplifier: ClassTooLong \u2014 780 significant 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 821-2120. The bar is 400 significant lines; this is 380 over it, 1.95\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02ec0684c264ff0138b19d164191c73e79bf1b52e01a11ece661bd50cfc7311"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarValue.try_from_array: MethodTooLong \u2014 try_from_array runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":4333}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bf35744f1d75758685b9694a86c623c609924e842add715f35f61de6da3006"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Unparser.scalar_to_sql: MethodTooLong \u2014 scalar_to_sql runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"615bdc8de47f092f4ea95860e480850ba8851ee6a28d84b857a4026e59870dd8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.map_children: MethodTooLong \u2014 map_children 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":"datafusion/expr/src/tree_node.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e35d9ffad6bc3919edca932cf4c81ab2b8ed452ed6e58759fb85c77c78159e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlToRel.convert_simple_data_type: MethodTooLong \u2014 convert_simple_data_type 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":"datafusion/sql/src/planner.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fdd2d3a19aaa376393b255f97b857b734e7dcb0a6ff2a49a89dd9851485d21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_functions_aggregate_common::min_max::min_max_scalar_same_variant: FunctionTooLong \u2014 datafusion_functions_aggregate_common::min_max::min_max_scalar_same_variant 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":"datafusion/functions-aggregate-common/src/min_max.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08c28ba5134e01da56583d60441ff235e92935f60eed03ea66f3ff0c82e8ef1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: datafusion_common::cast: TooManyFunctions \u2014 55 free functions. The bar is 30 free functions; this is 25 over it, 1.83\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/cast.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7384db6d595974851be1ed5bd62e17eb71f4f39d0d9fde3ec1772d7091e61b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/projection.rs: FileTooLong \u2014 912 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 412 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/projection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c96a3f5969381b6e8022ce55195b59da2ca3b41d52c32d2fddc15d893304cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.fmt: MethodTooLong \u2014 fmt 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":"datafusion/expr/src/expr.rs"},"region":{"startLine":3620}}}],"partialFingerprints":{"codehealthFindingId/v1":"013294886bad83ad6fb6271a27971c1e05689a18ad0ab169a4937d6f5360bc20"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.to_field: MethodTooLong \u2014 to_field runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"0937b06ac3f409c73bac09674c00743e12c7857c037fd8f049c365e55e774059"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_physical_plan::joins::utils::estimate_join_cardinality: FunctionTooLong \u2014 datafusion_physical_plan::joins::utils::estimate_join_cardinality runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a02291593b1ac91fc7ba5d13558e32509167048a5a7cb38a20efc8c2b940087"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/signature.rs: FileTooLong \u2014 895 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 395 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"105bf383762c627e9fdcc093e3009630e5b411522e6bb31f62f3493f29be8205"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/display.rs: FileTooLong \u2014 890 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 390 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53f86e5367d8d008145c4b6a01da4a1193683fa796ec6cc45272f2f204e11c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PagePruningAccessPlanFilter.prune_plan_with_page_index_and_metrics: MethodTooLong \u2014 prune_plan_with_page_index_and_metrics runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/page_filter.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"19977595ae040300a0030249abf97c12e54d53a660f74b96119a79b37d7f4e35"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/push_down_filter.rs: FileTooLong \u2014 889 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 389 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9712fe5822cda88d6ef831582aaddc6ce2064518ece8bc853b1a1e1cceab7fed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Expr: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec9cf9fadc1ac3579cd54b58436b1611298e670b5c19dde2cdab822c7697f9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AggregateExec.try_from_proto: MethodTooLong \u2014 try_from_proto runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":2634}}}],"partialFingerprints":{"codehealthFindingId/v1":"971ac1a002f6990c8eaf9648f1805e261962046f57e04551325a7503c5dcb50f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hash_utils.rs: FileTooLong \u2014 878 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 378 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":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7e5340545255d72e48d624f4c53b56a1ae952c699a0e3a396dd46230ce3875"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_substrait::logical_plan::consumer::types::from_substrait_type: FunctionTooLong \u2014 datafusion_substrait::logical_plan::consumer::types::from_substrait_type runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/types.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"037a5e921478fae202f7925ce412eb88f4c82caf4f11cefd2044049669775460"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GroupedHashAggregateStream.new: MethodTooLong \u2014 new 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":"datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c292a569fe56a25b455a3b12d5083aecd99bf80a48ff494a8643678a7b9abf50"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EquivalenceProperties: ClassTooLong \u2014 694 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 59 methods, 3 blocks, lines 375-1927. The bar is 400 significant lines; this is 294 over it, 1.74\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/properties/mod.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b075f8bcd82262821bf50c6f6f1b3c415d785b8968d5ce86ec14a796a149594"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 867 significant 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 70% of them inside a single declaration: DFParser (2 blocks, 439-1505). The bar is 500 significant lines; this is 367 over it, 1.73\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":"datafusion/sql/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b5e332ddb514676e071348eca9f2d6712bddcb50fa4345ef9925dbeaaadc31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/utils.rs: FileTooLong \u2014 859 significant 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 63 free functions. The bar is 500 significant lines; this is 359 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d87a5baad5dc9699bf6af512536fce770677874d9379af5bb6e83f8d1fc293"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/decorrelate_predicate_subquery.rs: FileTooLong \u2014 857 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 357 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":"datafusion/optimizer/src/decorrelate_predicate_subquery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e9d7d8421152defab293f855cbd5b3cd3c23657d09c02a43a729944822660b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DFSchema: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/dfschema.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f62d3e5e104863b1a530eecc7aba4ccc4a97a0a783a99b4837e1c013f963e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/case.rs: FileTooLong \u2014 845 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 345 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":"datafusion/physical-expr/src/expressions/case.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a01dbbe6a4c7c6b72a018b83b1ef110a5d086960e5a2a68f3c401303d8783f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dfschema.rs: FileTooLong \u2014 844 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: DFSchema (11 blocks, 102-1428). The bar is 500 significant lines; this is 344 over it, 1.69\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":"datafusion/common/src/dfschema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"846c2759235c2149bedeb5234c74c0267a9e84a8d6a2b484f36c700fe84d688d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionState: ClassTooLong \u2014 671 significant 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, 9 blocks, lines 133-2481. The bar is 400 significant lines; this is 271 over it, 1.68\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77cf5557b180ab9caa8856e276e14257bf88b33447533504194953b7a5f2b38"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GroupedHashAggregateStream: ClassTooLong \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), 15 methods, 5 blocks, lines 272-1477. The bar is 400 significant lines; this is 268 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"911f2ef1e06c6789dc5e619440abfcf3dc2159ed994e99d93ff70d19600bbf5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_physical_plan::joins::hash_join::exec::build_in_memory: FunctionTooLong \u2014 datafusion_physical_plan::joins::hash_join::exec::build_in_memory 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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"692d8421fca040fd2a17566f021a29f4d161abcf7a731e33279e9fd73d2ae77c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/information_schema.rs: FileTooLong \u2014 827 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 327 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":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b08e516d4c0ff4115dcbfd9ea3bbd79a13881b2391195a2dea6c7bb85de890b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ListingTable: ClassTooLong \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), 32 methods, 5 blocks, lines 173-1287. The bar is 400 significant lines; this is 261 over it, 1.65\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog-listing/src/table.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0e5e00ef8e895e3996d1d6ab5b49614ea99179d5d03d9b877f7885e05d3d60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: datetime/date_trunc.rs: FileTooLong \u2014 826 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 326 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":"datafusion/functions/src/datetime/date_trunc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c5c6a39953772422a63aac70729dacda1f26c99c7ef7c9c83e2b8d2c365e71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/table.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), about 81% of them inside a single declaration: ListingTable (5 blocks, 173-1287). The bar is 500 significant lines; this is 318 over it, 1.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog-listing/src/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7283829efdc7b015c935ca563fe2731a7d1b86f419c2229d27d00679934a652"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/function.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), about 82% of them inside a single declaration: SqlToRel (214-1189). The bar is 500 significant lines; this is 318 over it, 1.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d39493e9a61ade002fe58aa05134b35a51169ad9d22fc6e40bd6001e6e40ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/strings.rs: FileTooLong \u2014 815 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 315 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":"datafusion/functions/src/strings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf3472ce92b2655e18e8d4e56049e83efdfed769093806c9ec2ab94a9ea6f70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/average.rs: FileTooLong \u2014 813 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 313 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":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ae01a2d9c95bf5f97db0e1512e1db94cacec19d9af5cc0165b7e2f67e56255"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logical_plan/tree_node.rs: FileTooLong \u2014 811 significant 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: LogicalPlan (2 blocks, 47-1116). The bar is 500 significant lines; this is 311 over it, 1.62\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3a5391db259ac07963e4a8b04199c9c51058125c1602f8181154c028d5e726"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: to_proto/mod.rs: FileTooLong \u2014 811 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 311 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/to_proto/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"634ffd881b467ea5318a654f5ac9fcfadaab0f3d6c973047156ad3307764a081"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: enforce_sorting/sort_pushdown.rs: FileTooLong \u2014 810 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 310 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfa9138964142d2f2ed89dbcee5e1d68cbd6f07888e69da411bd32181e4dc78"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarValue.eq_array: MethodTooLong \u2014 eq_array 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":4832}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f50c4801f740d8827bf5d733cf72ad2aaaa723c7f5d03fe89fdb0375648557"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: properties/mod.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), about 87% of them inside a single declaration: EquivalenceProperties (3 blocks, 375-1927). The bar is 500 significant lines; this is 302 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":"datafusion/physical-expr/src/equivalence/properties/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14df2a9a6a8f3563113b132c26fa4429a91efae5574c0de8b419f893a070ead"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogicalPlan: TooManyMethods \u2014 48 methods, declared across 2 files: logical_plan/plan.rs (35), logical_plan/tree_node.rs (13). The bar is 30 methods; this is 18 over it, 1.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. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"724e5e33b6529bd0ab2120ba10230eb9f3484952e412cbe14e0c4f989a1fa7e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/functions.rs: FileTooLong \u2014 797 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 297 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion-cli/src/functions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"793dced3114ecd187b7d72a07898537b9a14906961b58debe0c7ab7005cdd364"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeCoercionRewriter: ClassTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 3 blocks, lines 280-1141. The bar is 400 significant lines; this is 230 over it, 1.58\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/analyzer/type_coercion.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b84b9c5f2b06adb12e68c68b5e88bf8346b1c964085a51b69e6f4f749450dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/decorrelate.rs: FileTooLong \u2014 785 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 285 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":"datafusion/optimizer/src/decorrelate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f52fc31e29beff77997a619e711ac912ebc3beca267aa753c2fb8a64e8f7418"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/unnest.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":"datafusion/physical-plan/src/unnest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85658b8b1efcdc1b672e6f4d50f6e35009b724838e52f91c94a24aeba05a55f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_coercion/functions.rs: FileTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 280 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":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"464f37ee973a1fba506cc076891a0abae8e129e2a16bae995708cab8846a27f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file_scan_config/mod.rs: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 278 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/file_scan_config/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f362e10b9c65aeb93f2207295d85d2e9448a3b1e2609a8935f6539651a35b16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ListingTableFactory.create_inner: MethodTooLong \u2014 create_inner runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/listing_table_factory.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"561860f60dc4f4dcfd20379b17f2837107fecafbaa6586751f0d309ebcecd182"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unparser/dialect.rs: FileTooLong \u2014 773 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 273 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/dialect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace27c135a386e2cedbd0d8f55e27f8287e5440fa7997baab83b054efaf8f5a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AggregateExec: TooManyMethods \u2014 46 methods, declared across 2 files: aggregates/mod.rs (38), aggregates/optimizations.rs (8). The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f1193dde55f9196c2bb38ddb056deac9a3bab9cd12224e48f11c001afcefdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/array_has.rs: FileTooLong \u2014 766 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 266 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_has.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b97bad3ea244e9416e702b02c5966f0b06feb5a84743d670513e25469e7ea00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarValue.fmt: MethodTooLong \u2014 fmt runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":6061}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8688d6a78183394804b2694af0ec6a45085d5931d37b66d831af8a313a92f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sort_merge_join/bitwise_stream.rs: FileTooLong \u2014 764 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: BitwiseSortMergeJoinStream (2 blocks, 239-1249). The bar is 500 significant lines; this is 264 over it, 1.53\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":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30aa5d4bc65d36ce15dd7968e076c71b1ee5b7bc1a0d92145b521fc035b401aa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionStateBuilder: ClassTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 65 methods, 5 blocks, lines 1156-2110. The bar is 400 significant lines; this is 210 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":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"22817a7d80b4c529a51fb67bf5cb3864a397f4a082e7ab9dbe2df17cec735e44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: physical_plan/mod.rs: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 261 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/physical_plan/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f39cd133c081ca0a73f4220af5a4cd18193e315a53fb6da0c04dea62e11e475"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.hash_node: MethodTooLong \u2014 hash_node 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":"datafusion/expr/src/expr.rs"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"0863235b4f034d5212b69ec7925ad162d493c63ba176a9ba84fb9e5e32a05ed6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/mod.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), declaring 48 free functions. 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":"datafusion/common/src/utils/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e60f92bb71008281de31b28b73b7948358ffe7bac970eae345a4d731124357"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_pruning::pruning_predicate::build_predicate_expression: FunctionTooLong \u2014 datafusion_pruning::pruning_predicate::build_predicate_expression runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e0e6410adf16d5e67618fc103bc96c53a15774d36a42278ac066c40eecc31c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DFParser: ClassTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 2 blocks, lines 439-1505. The bar is 400 significant lines; this is 203 over it, 1.51\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/parser.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc3b542f4a890aba3f9559da50d5af2efbb8214ed3c5e0851439108c4c3bcb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/percentile_cont.rs: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 243 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/percentile_cont.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0f7f8aa9f075a7a0084f30920b27abd5e1255dd2d94e1d5a2135ff046712e3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FilterExec: 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), 15 methods, 6 blocks, lines 73-1127. 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":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3e15bcd96299d2f12a6ce1cb13643bada9bbc5ef599806f8808c44bd80d83a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionStateBuilder.build: MethodTooLong \u2014 build 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":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"183839673347dc503fcff1a632b5c855e853d6c0ae4f137305550d04b6ca1468"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BitwiseSortMergeJoinStream: ClassTooLong \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), 32 methods, 2 blocks, lines 239-1249. The bar is 400 significant lines; this is 191 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":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4045ed0301f546ce6ae63b19a4d4eff066854795351403eaf85ca246222c99e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sort_merge_join/exec.rs: FileTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: SortMergeJoinExec (6 blocks, 156-1044). The bar is 500 significant lines; this is 237 over it, 1.47\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/exec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b583f65f158e345f443b130a941c2ef04511993e4a51585e56268fa1ddf386"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_sorts_helper: FunctionTooLong \u2014 datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_sorts_helper runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2649775e04aec6d296a62b936893e52afbe00c9047dcbf17e157fed7cce172"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SortMergeJoinExec: ClassTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 6 blocks, lines 156-1044. The bar is 400 significant lines; this is 187 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/exec.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a5ff359c0d00458fcb5637c8bdb69a4803d252c41d0c01fd8f7bf7c2a70eef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: datafusion_functions::math::monotonicity: TooManyFunctions \u2014 44 free functions. The bar is 30 free functions; this is 14 over it, 1.47\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/monotonicity.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1167782e1515c876658b072a0fe1c4ce32c64cc2ca1c27b401267a20dbf2a37a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PreparedParquetOpen: TooManyFields \u2014 44 stored fields beside 2 methods. The bar is 30 stored fields; this is 14 over it, 1.47\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/opener/mod.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0dd33dfa4fb5be9c7f733f37a5d37991eb606c85d237aea7aae49dcc5b0c90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/nested_struct.rs: FileTooLong \u2014 730 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 230 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":"datafusion/common/src/nested_struct.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2e990f3aa0136076d3bfed1a1420b218a6c2aefeaa393963034a43b2e36bdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/metadata.rs: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 228 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba7730998937f90d8464c44649170858e2bc246e28e6b3d9dfdd803fa585780"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: aggregates/grouped_hash_stream.rs: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: GroupedHashAggregateStream (5 blocks, 272-1477). The bar is 500 significant lines; this is 228 over it, 1.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb4102feb29b284c3224ac6debd19a1e69c7e2e9018ed71059cfc7b8f90a9c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashJoinStream.process_probe_batch: MethodTooLong \u2014 process_probe_batch 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":"datafusion/physical-plan/src/joins/hash_join/stream.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96dbadfde969d62946cb838cfcffb6e21eed03c8023c268ae0e83bb1cca20bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarValue.partial_cmp: MethodTooLong \u2014 partial_cmp 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b1f841476fa0b78bfadc30ae3b2c488f921dc79cea4a8f4523ed79fcfda82e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DateTruncFunc.invoke_with_args: MethodTooLong \u2014 invoke_with_args 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":"datafusion/functions/src/datetime/date_trunc.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0329d57e3ad7a7c152be913d84726978782673e3543938d0bdc3fbfde8fa14"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ParquetSource: ClassTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 4 blocks, lines 283-1332. The bar is 400 significant lines; this is 172 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/source.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3301b7bd2f0cbe899a470ff8bd7172caf5ab58d08e84802818d38d474a3563"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SymmetricHashJoinExec: ClassTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 5 blocks, lines 163-953. The bar is 400 significant lines; this is 172 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/symmetric_hash_join.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d535fa1c8195515d4b2c9fce3651e62b2c46017ec6ef5464ff4d10c8254117e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefaultPhysicalPlanner.plan_aggregate: MethodTooLong \u2014 plan_aggregate 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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa82fa0c0b5ac99bd430a4cdd20cf392421a5985b7dc2c64052098d2fe7676b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParquetOptions.try_from: MethodTooLong \u2014 try_from 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":"datafusion/proto-models/src/from_proto.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"7985d018841e1bd00aa1626c469765ce6c5653e6376ac22b4c6c0ecd026bf225"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SingleDistinctToGroupBy.rewrite: MethodTooLong \u2014 rewrite runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/single_distinct_to_groupby.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"15537ad1d53dc551cb9a89e25e95494b414f8c5d8b8317b8845940d8041f9c46"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommonSubexprEliminate.try_optimize_aggregate: MethodTooLong \u2014 try_optimize_aggregate 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":"datafusion/optimizer/src/common_subexpr_eliminate.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f42f5c930b972368d0d2f17c2d65e21d2d6b1fb4d49bc657ee86dab08ca200a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MaterializingSortMergeJoinStream: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6865ff4cbe18b2b226bfea8511d5f578726812d2d8b5d8fa22d5193cb5a4c678"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarValue.fmt: MethodTooLong \u2014 fmt 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":5858}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bde294bc4f84b9889c12833b9f8a6d71ceb1ed80f08c3d627adfc340e378292"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_expr_common::casts::try_cast_numeric_literal: FunctionTooLong \u2014 datafusion_expr_common::casts::try_cast_numeric_literal 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":"datafusion/expr-common/src/casts.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10f124ef0a54f88de3dbef2022138098c8cca6053d18ddba3d41d4e3d79da4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_functions::math::round::round_columnar: FunctionTooLong \u2014 datafusion_functions::math::round::round_columnar 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":"datafusion/functions/src/math/round.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85a47234725c7201ee95b28139a59d0f9a1b7b9d0c82a466510a2a3bbe0569f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_physical_optimizer::ensure_requirements::enforce_distribution::enforce_distribution_relationships: FunctionTooLong \u2014 datafusion_physical_optimizer::ensure_requirements::enforce_distribution::enforce_distribution_relationships 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8306bb0928bafad665629419b46858032c874147be5cf60947e4480b14d567"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymmetricHashJoinExec.try_from_proto: MethodTooLong \u2014 try_from_proto 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":"datafusion/physical-plan/src/joins/symmetric_hash_join.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f757a7669f61f8e863147a3e5bdd8d5f1cd56a8bee31e8423845afdfd46438"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SortExec: 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), 18 methods, 5 blocks, lines 1436-2310. 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":"datafusion/physical-plan/src/sorts/sort.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d3979d125c6152fbf2c904aa420bf5f1579cae690f27823de376ed08e93d0d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExternalSorter: ClassTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 32 methods, 4 blocks, lines 250-1388. The bar is 400 significant lines; this is 152 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":"datafusion/physical-plan/src/sorts/sort.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"28afb71b8dec54c5b59b28f0cd0fd5f2e12dcc3e10c1a713057f1a1dc027cdcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logical_plan/ddl.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":"datafusion/expr/src/logical_plan/ddl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa73535b69ed80b941213bb1349940bddf5d28840f4477c874447527980824ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_optimizer::decorrelate_lateral_join::rewrite_internal: FunctionTooLong \u2014 datafusion_optimizer::decorrelate_lateral_join::rewrite_internal runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate_lateral_join.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8e8eff7eacfce714623e92b6ab198b224e3a5813895ebb05196c337f3031fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_substrait::logical_plan::consumer::rel::read_rel::from_read_rel: FunctionTooLong \u2014 datafusion_substrait::logical_plan::consumer::rel::read_rel::from_read_rel runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/rel/read_rel.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"69108e3026a4dbea04fa17d92fc3e860024321b33dafcc93b35d09732c6f2370"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/extract.rs: FileTooLong \u2014 689 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 189 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":"datafusion/functions-nested/src/extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"874c482107cf619618b8cb2c3934111d3df03a7c48f708312509eec16edc0e09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/extract_leaf_expressions.rs: FileTooLong \u2014 689 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 189 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":"datafusion/optimizer/src/extract_leaf_expressions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24465aa3275ffe0b616e9ba4f652faeadfe0d12c6957a8586c5cdb31c6eca1b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/execution_plan.rs: FileTooLong \u2014 689 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 189 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":"datafusion/physical-plan/src/execution_plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b69aad1b9749acb8b33a31df43fe6599fb3848508238fc92868240d0f13f03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: math/round.rs: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 186 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/round.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1680a78b73e0547006414f2cb0976ab8da3e8671a8eb30ffe2debcb3390891"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/udaf.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":"datafusion/expr/src/udaf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce58259ee2655cb9c743c3cb04798a78b58b52d658b2af076898c75e528e454d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/generate_series.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":"datafusion/functions-table/src/generate_series.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f800e6b172c59bc5c505489b351cb2b11d8102cdebfd0b9388434c4c5cf9987e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DFSchema: ClassTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 51 methods, 11 blocks, lines 102-1428. The bar is 400 significant lines; this is 141 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/dfschema.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e212b31d195214b563aa1de63144d2c2f2392b67274dc3ed3b193bb5e6bb3e81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/source.rs: FileTooLong \u2014 676 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 176 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":"datafusion/datasource-csv/src/source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2232fbc58953b5ffa6965ed95343b78047a8481b9f23166aec412cb70ed115"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: multi_group_by/mod.rs: FileTooLong \u2014 674 significant 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 70% of them inside a single declaration: GroupValuesColumn (3 blocks, 197-1357). The bar is 500 significant lines; this is 174 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d523ff187032af109cfd1304712bccb32fcd1ae820a0732d2816ebb6d5693048"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/source.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), about 85% of them inside a single declaration: ParquetSource (4 blocks, 283-1332). The bar is 500 significant lines; this is 172 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":"datafusion/datasource-parquet/src/source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3215de049664fe5b6f70d54851fb5b018d9d70fde4b472fb931b5dfd12877d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/planner.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). The bar is 500 significant lines; this is 168 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":"datafusion/sql/src/planner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b3ddbaee0ed9f8cd0a50ab3a461f3e2f22ad499b7b00b8ffa4d225b685c556"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataFrame.describe: MethodTooLong \u2014 describe 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":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8633815667d43503bc0e4b38278d709318a729cb4e350c3aa785e7deba91bb87"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalPlan.recompute_schema: MethodTooLong \u2014 recompute_schema 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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f9f6148607ce17cdeff52340020a0a5fbbe7c6b35d44bcca94a5cf3dc338b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashJoinExec.execute: MethodTooLong \u2014 execute 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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5f9d0d37f6b01f6b65e16fde25292c9e652e1eed9ce96a2ec1003cda456ccd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RepartitionExecState.consume_input_streams: MethodTooLong \u2014 consume_input_streams 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":"datafusion/physical-plan/src/repartition/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"549f52af7dafea9e6a3011fc1e5d147ff2bdf8db46d29baba8acf0dbc7e843b0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BinaryExpr: ClassTooLong \u2014 531 significant 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, 8 blocks, lines 48-1242. The bar is 400 significant lines; this is 131 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":"datafusion/physical-expr/src/expressions/binary.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f358ae15eae3dc4dafd1beffd8da10c50b8bbcf1816b359d2194d5b2ce4bd88a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RepartitionExec: ClassTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 6 blocks, lines 1527-2432. The bar is 400 significant lines; this is 130 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":"datafusion/physical-plan/src/repartition/mod.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7402f47765d5050a95a77f81492d7604c6420b8ac784cf4330f1eb334192e443"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hash_join/stream.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 63% of them inside a single declaration: HashJoinStream (4 blocks, 384-1250). 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":"datafusion/physical-plan/src/joins/hash_join/stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bab4ef6c67618aa770b9d656bee95aa95d8dc1aab994dd143ef08ab006ff5fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ListingTable.scan_with_args_inner: MethodTooLong \u2014 scan_with_args_inner 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":"datafusion/catalog-listing/src/table.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fe01001f63a60fdccfeb18130fa8684c1daa82629eee292ecd40aec3b32ad2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeType.default_cast_for: MethodTooLong \u2014 default_cast_for 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":"datafusion/common/src/types/native.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3209df6ef33812055dc3bbeb2347f12025e16d146a7e3422ffe42b50182288c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BinaryTypeCoercer.signature_inner: MethodTooLong \u2014 signature_inner 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":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"130838483d345176d91e7ad243e44f27900ab57454d04ded9bf93f76aaff123b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsonOpener.open: MethodTooLong \u2014 open runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-json/src/source.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b743b8f4b17b41ac3c64ebcda2b83b814a54687aa092bc7babf15fca54ea4ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParquetMorselizer.prepare_open_file: MethodTooLong \u2014 prepare_open_file runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/opener/mod.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b9e2460ec07f16b8021c2bb60b14b25e3a682bb8f51398526f4d18f0f0dac1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PropagateEmptyRelation.rewrite: MethodTooLong \u2014 rewrite runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/propagate_empty_relation.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ee3b446dd0f7f49d06eaa559141cc9260ffdf9b8c94dace588855c26e02da1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlDisplay.fmt: MethodTooLong \u2014 fmt 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":"datafusion/expr/src/expr.rs"},"region":{"startLine":3364}}}],"partialFingerprints":{"codehealthFindingId/v1":"480a447990e1ef54a834d59ddbdc6edadbe6b7e7a57512fd1ad5361dfa345a9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlToRel.aggregate: MethodTooLong \u2014 aggregate 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":"datafusion/sql/src/select.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f1f61f2e7ecad8c47225b4ef92c16df0dd6a1ed616c6b037d33eaaf433d117"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/aggregate.rs: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 140 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/aggregate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"581844715e280c48392b54fc538b21d4b20fbb025f08e2f601f5f3b6925c6fd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: piecewise_merge_join/exec.rs: FileTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: PiecewiseMergeJoinExec (5 blocks, 271-978). The bar is 500 significant lines; this is 136 over it, 1.27\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":"datafusion/physical-plan/src/joins/piecewise_merge_join/exec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"009523d95eea7ceacdf0550324668969f3394d4f5826ace35de6f6a5add4c22d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/partitioning.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":"datafusion/physical-expr/src/partitioning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdd4a9a33669766dbd2ee7205a2cb94a98ac292320b19b9f952e9f9a71cb46c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeSignature.to_string_repr_with_names: MethodTooLong \u2014 to_string_repr_with_names 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":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a4037e31527fa8bfbc00f8451f3830c34e49de019a553dcef5cb5e31855e6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_optimizer::eliminate_join::rewrite_node: FunctionTooLong \u2014 datafusion_optimizer::eliminate_join::rewrite_node 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":"datafusion/optimizer/src/eliminate_join.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5666aa7c0379dc6a31aa7437679414f171fde3f070868c99176198e7daf600"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlToRel.create_default_relation: MethodTooLong \u2014 create_default_relation 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":"datafusion/sql/src/relation/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d940f17c0c9438ad2665bec3c8e0fd8ce7ffb517acd595a637a0b0953e48658"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: datafusion_functions::math::expr_fn: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/mod.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f256057d5a3a830667657bb8c97209508a28c85f119fe35cd9a6b1078968bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sink.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":"datafusion/datasource-parquet/src/sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2711bc6e3fce56d95337307b03ff31dbb856e7c04e77d0c6adb18f8c85f5a65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: datetime/to_timestamp.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":"datafusion/functions/src/datetime/to_timestamp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea95772cb4cee0e56928ca5984428d9b64fef603586ac1f015e322a81eea43a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefaultPhysicalPlanner.handle_explain: MethodTooLong \u2014 handle_explain 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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a5528a1baad5ca334a2f0dfec269c7b3f928c8ada573adde08f70cfc26dfce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/file_format.rs: FileTooLong \u2014 628 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 128 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-csv/src/file_format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4b30722a6e3ed78f79b3e69cfd486064dd91a4514ccf826105ff0b09c83510"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error.rs: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 126 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":"datafusion/common/src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7a0c09e28cc23ba691f07ab8cb4c1279d42e17867746a056fe648b4e1d72a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/projection.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":"datafusion/physical-expr/src/projection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1544eb0d090bb0b514b8f0a5fc8d61fc8183faaa95f621b7e3835222c9a8c517"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: datetime/date_bin.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":"datafusion/functions/src/datetime/date_bin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67a36dd068c6c58a4ba737be0dbc4635bb3f92d923af294a7475f4dfd6fa298"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParquetMetadataFunc.call_with_args: MethodTooLong \u2014 call_with_args 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":"datafusion-cli/src/functions.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"719be936879f7bd666dae66109f727bd4ad36e36013553c20e47d5955b0617be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Unparser.unparse_table_scan_pushdown: MethodTooLong \u2014 unparse_table_scan_pushdown 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":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7cd83fa800a1c5966ad344b70dbb49c00db6f349eca8d9de45f5512f777ca2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/stats.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":"datafusion/common/src/stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc0e787a6486e9eb17fe925dac38bb6ad1511c75409ebe8961502c9d04634c9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConcatWsFunc.invoke_with_args: MethodTooLong \u2014 invoke_with_args 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":"datafusion/functions/src/string/concat_ws.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"379715519f01d0dbae71ecf5cd63ded39e3d0e54f5aca5ceb6bc0eb92ee68c59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AggregateStream.new: MethodTooLong \u2014 new 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":"datafusion/physical-plan/src/aggregates/aggregate_stream.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6ab72fb8510cd339d86b6bc7a99c79eb0914643f66b4027e7ca4680153a9b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqlToRel.insert_to_plan: MethodTooLong \u2014 insert_to_plan 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":"datafusion/sql/src/statement.rs"},"region":{"startLine":2728}}}],"partialFingerprints":{"codehealthFindingId/v1":"0394570c18f55fc6538eb12f3016e635287e70c9f1d8b685490903197c4769da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/memory.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), about 73% of them inside a single declaration: MemorySourceConfig (4 blocks, 45-768). The bar is 500 significant lines; this is 108 over it, 1.22\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":"datafusion/datasource/src/memory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e45d0cb15c8b50ed2bfee835e7d6213a8a16b57eb9d6badcac2ae01b960d8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/approx_distinct.rs: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/approx_distinct.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba850fd885835a769feeb5ef716eeffc4b5366142e28a353c46889417a42c2a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: spill/mod.rs: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/spill/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52471d945d7f829f33bd2f25badc4551d18ca9df07b83c46e914c007b45d6c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_functions_nested::string::compute_array_to_string: FunctionTooLong \u2014 datafusion_functions_nested::string::compute_array_to_string 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":"datafusion/functions-nested/src/string.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"1870a58d292ee3551d74820ac05092a85004b08274f6f6acd8354d3ca68da99d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_macros::user_doc::user_doc: FunctionTooLong \u2014 datafusion_macros::user_doc::user_doc 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":"datafusion/macros/src/user_doc.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"972dd907be19a1c48e9fb5e987139298374541258dda70b0ba6407538f745c54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/file_format.rs: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 104 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":"datafusion/datasource-parquet/src/file_format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"305aae45b24bdefd9f8e921422d9fdcd3066278650f7f4df245a9223f8d6216b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/union.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":"datafusion/physical-plan/src/union.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e168d262e368e90cbb1f82a941aa32971be226a0f8b411d77587248461bf7b2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unparser/ast.rs: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 100 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f262f4300ce6e6a351fe86403aa0788c2b959f4cb4938fe1f135fb2a77684b5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_proto::physical_plan::from_proto::parse_physical_expr_with_converter: FunctionTooLong \u2014 datafusion_proto::physical_plan::from_proto::parse_physical_expr_with_converter runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/physical_plan/from_proto.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa8a29f2ff374d874a4d65d4b3a3a89f0883ab14621ad4e5bfe915d2cf41083"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/min_max.rs: FileTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 99 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":"datafusion/functions-aggregate-common/src/min_max.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b576b2fd534ae11d3f30da76f76fed9a0bc09c60e83e9e9f6b783e612cb8bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metrics/value.rs: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 98 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":"datafusion/physical-expr-common/src/metrics/value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b261c7d89162b60b475fccdb9c6b80853d84db28ef84a5411d1cd4b18d9cac3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_datasource::write::demux::compute_partition_keys_by_row: FunctionTooLong \u2014 datafusion_datasource::write::demux::compute_partition_keys_by_row 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":"datafusion/datasource/src/write/demux.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b53729ff0e2f394186fa7cf4506e11a11abc865cf4ddada235dba6bfa2511a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Unnest.try_new: MethodTooLong \u2014 try_new runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":5329}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d61ad8da35eefd62c4051b697b2f4ed933ca6d28c438429fbcf92af7ef1bba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: memory/table.rs: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 90 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/memory/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd30af0bbe932ffb85c6cb03cb4a989a483b4204eb9dfb4e5ee627188dc52bbe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RoundFunc.invoke_with_args: MethodTooLong \u2014 invoke_with_args 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":"datafusion/functions/src/math/round.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a016cd869f98640defbe3a5ac3cffff1b008644752df79574a975fa95efec084"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GroupValuesColumn: ClassTooLong \u2014 470 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 3 blocks, lines 197-1357. The bar is 400 significant lines; this is 70 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/mod.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c28411718fa714731a60e5b3ab4a43610bcd20a7229a4193bc9bcdc19dca611"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarValue.eq: MethodTooLong \u2014 eq 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bf3fa340fd172315fd5d0b1d674767d3d74ead885cae9337ae6ddc46c0660d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileScanConfig.try_from_proto: MethodTooLong \u2014 try_from_proto 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":"datafusion/datasource/src/file_scan_config/proto.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2514c58b033ac52c03da41c39d09635b5f4753ff742349d72974ffda0ee681"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_functions_nested::arrays_zip::arrays_zip_inner: FunctionTooLong \u2014 datafusion_functions_nested::arrays_zip::arrays_zip_inner 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":"datafusion/functions-nested/src/arrays_zip.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2046e0952973d5cda415b8dd69774930397baca985ca356af5cc7a798da8781"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_optimizer::extract_leaf_expressions::split_and_push_projection: FunctionTooLong \u2014 datafusion_optimizer::extract_leaf_expressions::split_and_push_projection 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":"datafusion/optimizer/src/extract_leaf_expressions.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cfeef29f03d74a3be1198cce4204762b6f1eb0781adc0652625d89821f0c8b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NestedLoopJoinExec: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 6 blocks, lines 206-1139. The bar is 400 significant lines; this is 67 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1351676e7df310826822c42c0add40824761313ce2177f1d97c61864a5415b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PullUpCorrelatedExpr: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 5 blocks, lines 40-944. The bar is 400 significant lines; this is 67 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c4b4c217fc5dc88785f388cd69b21c08b0b3012411f32eb85b73ed748af7e2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Interval: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a278be14946f8f18f69a4d3026e36bd64c7ef0a2f82dbe88b82a58b1d53b61"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AggregateUDF: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/udaf.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee22ebe4ab3299de6fb5bb5abe161b7b25f8de491dae7034c26e729b642b55f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FileScanConfig: ClassTooLong \u2014 461 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 5 blocks, lines 142-1643. The bar is 400 significant lines; this is 61 over it, 1.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/file_scan_config/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42e54a8a09824f90063b34936a052e0e5e6d7fa90466839b394eb518770c6a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logical_plan/from_proto.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":"datafusion/proto/src/logical_plan/from_proto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32afc10b7bb330fc4346aafbb3ab3cfec225712b5583dab42f522d5f49c65ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_substrait::logical_plan::consumer::utils::rename_data_type: FunctionTooLong \u2014 datafusion_substrait::logical_plan::consumer::utils::rename_data_type runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/utils.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4f96a29b7500e54aa563eb75a4d56d61f7194a94f4a961482a5d2dd1e72547"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/count.rs: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 70 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/count.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb40f1a7833a4b61ad499a64a8913f4a452b37b56e18b1575e2f7d4abd66ecac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarValue.arithmetic_negate: MethodTooLong \u2014 arithmetic_negate 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":2531}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d12d8128548c1c906aa5a08cd6a7491599af845a3c59a67d06c907c5f24d2e1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AsOfJoinExec: ClassTooLong \u2014 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 6 blocks, lines 130-746. The bar is 400 significant lines; this is 54 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b03d8bc0404010ab023f995d38b6bcdeb06dc53ea91d11751fb212fd029f44"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GroupsAccumulatorAdapter.invoke_per_accumulator_with_scratch: MethodTooLong \u2014 invoke_per_accumulator_with_scratch 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":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2100e36db21c54f8733ed43442382b49b79df1406b469ae2cfaf0ae66ecff1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hash_join/shared_bounds.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), about 65% of them inside a single declaration: SharedBuildAccumulator (3 blocks, 274-975). The bar is 500 significant lines; this is 63 over it, 1.13\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/shared_bounds.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed78cedff71116921662862436933fc6b2b84424f4c4578749bb4196a0821948"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logical_plan/information_schema.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":"datafusion/expr/src/logical_plan/information_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e396b7bac8f481d15fd77617cfa91ba6b1cd58b956ad85ee1cc99e2b94160d3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tree_node.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":"datafusion/common/src/tree_node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa47f7c54f63a6ef00ef168ef25915a63754fe4f73f122fd78b7d8a2a885cc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_datasource_parquet::schema_coercion::coerce_int96_to_resolution_impl: FunctionTooLong \u2014 datafusion_datasource_parquet::schema_coercion::coerce_int96_to_resolution_impl 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":"datafusion/datasource-parquet/src/schema_coercion.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df4b42f6725da2439681324b4bab915e898e46ec73b6149d7d3ca1b97fcf964"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_physical_plan::windows::window_equivalence_properties: FunctionTooLong \u2014 datafusion_physical_plan::windows::window_equivalence_properties 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":"datafusion/physical-plan/src/windows/mod.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1466b73fcd0724500d1d9f8995c77471530ec29bb8123f1aa2c54164a8e7d23"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DFParser.parse_create_external_table: MethodTooLong \u2014 parse_create_external_table 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":"datafusion/sql/src/parser.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb5dee16c140dce416e17aadc55d64235bbc62ca0532f9db127efe207dbe0de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: operator_statistics/mod.rs: FileTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 59 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/operator_statistics/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9041ae2b7922e313d61319de52bc3b0a555e487ff45598d5e19f60e95fe23972"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MemorySourceConfig: 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), 16 methods, 4 blocks, lines 45-768. 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":"datafusion/datasource/src/memory.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a03292bb37d3e81d3e3d9c706f00bbd73596934f31b299c7b3631693cfb9179"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RepartitionExec.execute: MethodTooLong \u2014 execute 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":"datafusion/physical-plan/src/repartition/mod.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4aa2fa8099df963fb4a000eab550259d403441e6390dc79462a0aae548e882"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_substrait::logical_plan::consumer::expr::subquery::from_subquery: FunctionTooLong \u2014 datafusion_substrait::logical_plan::consumer::expr::subquery::from_subquery 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":"datafusion/substrait/src/logical_plan/consumer/expr/subquery.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e045d4e85de6d33c38d1d9498bd5ff6b93271e91d69d1dce5e646e12147a3c9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PiecewiseMergeJoinExec: ClassTooLong \u2014 443 significant 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, 5 blocks, lines 271-978. The bar is 400 significant lines; this is 43 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":"datafusion/physical-plan/src/joins/piecewise_merge_join/exec.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d2b2dcdc682b5d3686a35deadbaa7e4021a4788b03dab04dd1a4683130090d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BitwiseSortMergeJoinStream: TooManyFields \u2014 33 stored fields beside 32 methods. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc43dc766e5ea0b50bc87bfb9abd7b252daaa9b7bfb637bf47c55a131fc5652"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MultiLevelMergeBuilder: ClassTooLong \u2014 436 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 3 blocks, lines 149-932. The bar is 400 significant lines; this is 36 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":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82532a82eb8e7ab53a980a1e1e0cd15d783c4e728ec50438f2a77d8d55c7ce3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrowFileOpener.open: MethodTooLong \u2014 open runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-arrow/src/source.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a89c3ec62b33107825fa31ec10518af1b582c1e953f3f76581890a6d8a35fc0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CsvOpener.open: MethodTooLong \u2014 open runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-csv/src/source.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e74c3ca97278f57cf981508ff1ec1e8fedd1da2a0871148bfd05f4604f0976"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DFParquetMetadata.statistics_from_parquet_metadata: MethodTooLong \u2014 statistics_from_parquet_metadata runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/metadata.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02b3c02ce367b94e4b7b733299076cb24cddb8c9e9fdb2cac22009332750160"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_physical_optimizer::ensure_requirements::enforce_distribution::adjust_input_keys_ordering: FunctionTooLong \u2014 datafusion_physical_optimizer::ensure_requirements::enforce_distribution::adjust_input_keys_ordering runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22a1bc8777409efa36ff94939ba5c3c60d0169c9a5505bf6ed80a346a4c8735"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultiLevelMergeBuilder.merge_sorted_runs_within_mem_limit: MethodTooLong \u2014 merge_sorted_runs_within_mem_limit runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"490d854f6025c154cc63df619e18e20aa1aec31a91b696db91aa9778a5a77a5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParquetOptions.try_from: MethodTooLong \u2014 try_from runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d6bff718788bcbff90423bd8af9573dc8e704206c562e0ec8d8c2d731e292d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PhysicalPlanNodeExt.try_into_physical_plan_with_context: MethodTooLong \u2014 try_into_physical_plan_with_context runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/physical_plan/mod.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa6bacd96571bb4c3f520e6e51546e5cd78d02424fd501ed64c2955f15269b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr_schema.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: Expr (133-806). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"985f5883889a9f826dc8d759b39f444531297d18b3c4d908f5ba7c20efafa0de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/higher_order_function.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 43 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":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02aa2f54fb8454fe60af7663d1b885ed16b1b1ef8eb008fb22ad45448316425d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: piecewise_merge_join/classic_join.rs: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 41 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/piecewise_merge_join/classic_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d9595a21ca46b28cd9fea7a2e542561bcf11e11ac970ec183add1612f6e1b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_requirement_to_children: FunctionTooLong \u2014 datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_requirement_to_children 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ba2a695c81b89facff5eb0a69305cccc9abbae69094e69b106f697d0fc02fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: aggregate_hash_table/common.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":"datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"442cc699cedce62410d122758c8dff099d65b2587dd4e415d84f81d2a3c1127e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/regr.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 38 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":"datafusion/functions-aggregate/src/regr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2caac1e1b7c8f0feff1e2e84a90389e3d23db002b430a699bf2c3f600619ee97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/string.rs: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3879b4a370c79115dc942faf72132975abd25fc414bbef87db4b0728316d7a0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_physical_optimizer::filter_pushdown::push_down_filters: FunctionTooLong \u2014 datafusion_physical_optimizer::filter_pushdown::push_down_filters 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":"datafusion/physical-optimizer/src/filter_pushdown.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f8822949ea5089bc51676fb0b8141e71515241b3e58517b62a8d766308aa78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_sql::statement::calc_inline_constraints_from_columns: FunctionTooLong \u2014 datafusion_sql::statement::calc_inline_constraints_from_columns 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":"datafusion/sql/src/statement.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"97745d8bafc64a95698d3f80fa4d317ef754afb6e3858f8f9ebf9579074e2c31"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ListingTable: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog-listing/src/table.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc793ce29fee505eaa26853d64e8c1a8c1841f01ea00b9af38856fe7fdba842"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BitwiseSortMergeJoinStream: 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":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b48cd6aa3d17ab883e3978f7d42e3f1a4380ea3bad8fc654b9ecff64b126d52"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExternalSorter: 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":"datafusion/physical-plan/src/sorts/sort.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee48948366e36d27b556f1dc3d33a4e8eb1378442aa8b009492e7a54d85c4081"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object_storage/instrumented.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":"datafusion-cli/src/object_storage/instrumented.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4aa27b3c43cdb41b87612cdf0c0bcae882312d873eb28d6d8f6914b394f9128"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/cast.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":"datafusion/physical-expr/src/expressions/cast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"300c41a3ca3174462be8e56a7add972e23c8cbaadab391d14ca6d8bd51b4c10f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr_fn.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 30 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_fn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a319eabb1dc24c7a0b2b0f2e85be0ca90ce49b705233831679e3841802d630f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParquetSink.spawn_writer_tasks_and_join: MethodTooLong \u2014 spawn_writer_tasks_and_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":"datafusion/datasource-parquet/src/sink.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e79c5d6cb491512ea1625756d2a40af255712f4bd4345ea618f409f8c34304"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_expr::higher_order_function::resolve_higher_order_function: FunctionTooLong \u2014 datafusion_expr::higher_order_function::resolve_higher_order_function 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":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e1d5a9439f100457d55c896f0698955f18bfa4efbfb513508ac3d887398aa6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Unparser.asof_join_to_sql: MethodTooLong \u2014 asof_join_to_sql 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":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"8408530fc8793d89c29714e02c70b3da0135e1d1ac696743b59153221289afa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/casts.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":"datafusion/expr-common/src/casts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b04f761eccaae765e4c0b794637507db322405d3ef47b741fca3d89d8e4b10e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/common_subexpr_eliminate.rs: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: CommonSubexprEliminate (3 blocks, 62-833). The bar is 500 significant lines; this is 27 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":"datafusion/optimizer/src/common_subexpr_eliminate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd2006cf97537cfcfa5ce2329e62146b586abcbde1b2beac4405eb12be4232e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarSubqueryToJoin.rewrite: MethodTooLong \u2014 rewrite 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":"datafusion/optimizer/src/scalar_subquery_to_join.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f74116cb765fab8669b4766482499b4077d190bf440ff2bf498d0ccf27c579"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datafusion_physical_plan::aggregates::group_values::row::encode_array_if_necessary: FunctionTooLong \u2014 datafusion_physical_plan::aggregates::group_values::row::encode_array_if_necessary 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":"datafusion/physical-plan/src/aggregates/group_values/row.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a8087733b519b2abdcb64af5f15e9cd74e6cdd0d47cec3b07714c130bd9b7d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HashJoinStream: ClassTooLong \u2014 419 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 4 blocks, lines 384-1250. The bar is 400 significant lines; this is 19 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":"datafusion/physical-plan/src/joins/hash_join/stream.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5219775e5e0a2a04b87eb37f838e1280f9cfec8da62e4c243140489e5b85879"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logical_plan/display.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 74% of them inside a single declaration: PgJsonVisitor (3 blocks, 307-852). 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":"datafusion/expr/src/logical_plan/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"050284b108bdc6b94d887e5c28c2f0fc4eea416553a03b2c23454cbc5fa8d6ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: physical_expr/mod.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/physical_expr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccf4938af4f7a4587c0d17603889f6ebf687592061ac400fd8bd130b05cfee4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sorts/partial_sort.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":"datafusion/physical-plan/src/sorts/partial_sort.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9edcc3f91360ed58813fa524331cf6515b4c34734847f865d4458da0ddadcbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/mod.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":"datafusion/ffi/src/session/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fc84fcbed556bae2a634a670d4db74a898eb7be9033f7c91b58f9c6723e442"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScanState.poll_scan: MethodTooLong \u2014 poll_scan 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":"datafusion/datasource/src/file_stream/scan_state.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bd645fbd04f040a4a45d0b7439d570ed07d1b2af6f47488229538f62511967"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.nullable: MethodTooLong \u2014 nullable 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":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4114c51bafb3c856214e70aa4d3a78d8ce3cbf57d9334a03fe1d4d9288da980f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/page_filter.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 19 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":"datafusion/datasource-parquet/src/page_filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"becb659c6ebb61ddfa7efd16bda6779ef2c3271871d9efe7da06b14b6de4d182"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MaterializingSortMergeJoinStream: TooManyFields \u2014 31 stored fields beside 42 methods. The bar is 30 stored fields; this is 1 over it, 1.03\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":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48682aaeab21217f1daf3af866d77ed714aed4d86a9efadf9e997d2c674457b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SelectBuilder: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. This type is on a published API surface \u2014 a cargo-semver-checks gate in CI (.github/workflows/breaking_changes_detector.yml) declares its compatibility contractual \u2014 so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/ast.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1d599b31141555fb176dcf684c8a50a846627b54b05297ea5dc0a5abea6cb0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ParquetMorselizer: TooManyFields \u2014 31 stored fields beside 2 methods. The bar is 30 stored fields; this is 1 over it, 1.03\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":"datafusion/datasource-parquet/src/opener/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e457eea1b37aba0e00d2dbf34152dd3892039ba64490e05c8027115b397c49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/table_provider.rs: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 16 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":"datafusion/ffi/src/table_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f929249169b7f6eb7694f69af67d87a74a6ab2ba00230141b16441f23b909e63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/statistics.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":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1b1e26469133d7b75376a523a19033caf7af5ce611e3e8f0c11ad6e5261f53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/materialized_cte.rs: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/materialized_cte.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b038bc464d651c73dc6f2a5748228d468c605386c4b9cbd3cfcfeff8c96dea6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sorts/multi_level_merge.rs: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: MultiLevelMergeBuilder (3 blocks, 149-932). The bar is 500 significant lines; this is 12 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da108c0c113e5f7e9afddbc75e7ddd147ac48c1ebc59d543334c1560722d9167"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DictionaryGroupValuesColumn: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 2 blocks, lines 29-686. The bar is 400 significant lines; this is 7 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/dictionary.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"49de0d8816145c9e713708456e1df92ddd20033950360ae2bc9df4525e72a707"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GroupedHashAggregateStream.poll_next: MethodTooLong \u2014 poll_next 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":"datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"243943f1ed432a4d97283272afa8477cb44bc8c1e285ed3be8cf22d340f12647"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/window_state.rs: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/window_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb70d01dc113d930871adbc951f4ab556a5454336f34951afc4f16a44a4f47e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PushDownFilter: ClassTooLong \u2014 402 significant 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 155-1615. The bar is 400 significant lines; this is 2 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af43aa4c3ba58fd11cc7a04c77a19c2cc228c9b67410552fd6df324395d75c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: equivalence/class.rs: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: EquivalenceGroup (6 blocks, 310-1017). The bar is 500 significant lines; this is 1 over it, 1.00\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"848456e2eacd38e301c9fdf09831e90668991213a7ae200a9e706e09de5ab54a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 10 shared lines): datafusion/functions-nested/src/array_avg.rs:83-98 | datafusion/functions-nested/src/array_normalize.rs:89-104 | datafusion/functions-nested/src/array_product.rs:87-102 | datafusion/functions-nested/src/array_scale.rs:91-119 | datafusion/functions-nested/src/array_sum.rs:83-98 \u2014 These 5 members are variants of one another: a block of 10 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_avg.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0c2427473426bbf847e4bbcaa3c7d33b90e97b95447a09cd71f559ba0eaf6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 26 shared lines): datafusion-cli/src/object_storage.rs:385-420 | datafusion-cli/src/object_storage.rs:470-507 | datafusion/common/src/config.rs:2508-2539 | datafusion/common/src/config.rs:3289-3320 \u2014 These 4 members are variants of one another: a block of 26 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":"datafusion-cli/src/object_storage.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc46c442643bd0b07ba5ec22873ee6d3c0a37419a7fc8fbd300aeeeab3d7cc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (58 shared lines): datafusion/functions/src/string/ends_with.rs:80-147 | datafusion/functions/src/string/starts_with.rs:76-143 \u2014 These two members are variants of one another: 58 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":"datafusion/functions/src/string/ends_with.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1d8c98e5cd89606aedc9be1f44d9c9ec4fc78259d180a83c849bacc2ef8921"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (45 shared lines): datafusion/common/src/scalar/mod.rs:2001-2076 | datafusion/common/src/scalar/mod.rs:2079-2150 \u2014 These two members are variants of one another: 45 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba520672782d3a76586d7f21194fc0466006d42c0a3e2d7857d56d3112d4e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (40 shared lines): datafusion/physical-expr/src/expressions/case.rs:772-911 | datafusion/physical-expr/src/expressions/case.rs:918-997 \u2014 These two members are variants of one another: 40 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/case.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"865455c4873e43c6dc640d4798fc69087793ef229c0d982c1f43463f14455867"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): datafusion/datasource-csv/src/source.rs:923-976 | datafusion/datasource-json/src/source.rs:593-642 \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":"datafusion/datasource-csv/src/source.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"092f44e8c91854ac0d1f0e130f2dc5b2c75e002304509fa8a56e498676479d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (31 shared lines): datafusion/physical-plan/src/display.rs:272-317 | datafusion/physical-plan/src/display.rs:471-512 \u2014 These two members are variants of one another: 31 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d45fe2633f9b7ebc4e7365817ff32cabee14bdbe563a0b11105a8d509f3867"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (24 shared lines): datafusion/common/src/dfschema.rs:715-780 | datafusion/common/src/dfschema.rs:787-866 \u2014 These two members are variants of one another: 24 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":"datafusion/common/src/dfschema.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9a9afa2640cc5f192f9f2891210a243dd6082b436c4b5d258eace24275cee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): datafusion/physical-expr/src/expressions/case.rs:121-217 | datafusion/physical-expr/src/expressions/lambda.rs:65-132 \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":"datafusion/physical-expr/src/expressions/case.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6c5e69f0ab4f96501be3c5fe7ab4740c56d6588fe2094b863fa881d5b31d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): datafusion/functions/src/unicode/find_in_set.rs:264-285 | datafusion/functions/src/unicode/find_in_set.rs:292-312 \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":"datafusion/functions/src/unicode/find_in_set.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7851d0ff89c14140d95243c4d180e6d4336487d791bb8bf58998757d4c3d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): datafusion/physical-expr/src/simplifier/const_evaluator.rs:37-68 | datafusion/physical-expr/src/simplifier/const_evaluator.rs:83-142 \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":"datafusion/physical-expr/src/simplifier/const_evaluator.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bf312bde779cb6d842b797f3ff74c4e525d8e8551c5be91aba8a4cf5d62dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/common/src/config.rs:2443-2475 | datafusion/common/src/config.rs:2481-2505 \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":"datafusion/common/src/config.rs"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"737fa4122d98cdc4153fff669a6daec340a7bcb9da54465e100b43cb28a8e08e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/physical-plan/src/topk/mod.rs:1855-1892 | datafusion/physical-plan/src/topk/mod.rs:2829-2862 \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":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"a337da3e5f34cfa7218c16f656ca0a73ddac6f905d4d9a144843a7e6ec263b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): datafusion/physical-plan/src/aggregates/mod.rs:2169-2225 | datafusion/physical-plan/src/async_func.rs:165-178 | datafusion/physical-plan/src/buffer.rs:164-176 | datafusion/physical-plan/src/coalesce_batches.rs:173-186 | datafusion/physical-plan/src/coalesce_partitions.rs:154-168 | datafusion/physical-plan/src/filter.rs:697-713 | datafusion/physical-plan/src/limit.rs:191-205 | datafusion/physical-plan/src/limit.rs:481-494 | datafusion/physical-plan/src/sorts/sort_preserving_merge.rs:278-291 | datafusion/physical-plan/src/unnest.rs:231-247 | datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:465-484 | datafusion/physical-plan/src/windows/window_agg_exec.rs:256-270 \u2014 These 12 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 12 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da268ce844fd7f34468ee4b17b8ebde97b14bcc2fc03e277528b69b1bc9deac"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): datafusion/ffi/src/query_planner.rs:127-164 | datafusion/ffi/src/table_provider.rs:279-317 | datafusion/ffi/src/table_provider.rs:324-354 | datafusion/ffi/src/table_provider.rs:360-391 | datafusion/ffi/src/table_provider.rs:398-457 | datafusion/ffi/src/table_provider.rs:462-483 | datafusion/ffi/src/udtf.rs:123-156 \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":"datafusion/ffi/src/query_planner.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6278336e0069577a9c3307ee0d8e819d13d8be94b78349f0ec7efbc667d5b653"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): datafusion/functions-nested/src/utils.rs:222-247 | datafusion/functions/src/regex/regexpcount.rs:88-113 | datafusion/functions/src/regex/regexpinstr.rs:106-131 | datafusion/functions/src/regex/regexpmatch.rs:99-131 | datafusion/functions/src/regex/regexpreplace.rs:157-219 | datafusion/functions/src/regex/regexpreplace.rs:678-813 | datafusion/functions/src/utils.rs:106-143 \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":"datafusion/functions-nested/src/utils.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2b60ff503a2fcbd49ef0499d34079a9aa1e634b00edab95809e1c467c31721"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): datafusion/ffi/src/catalog_provider.rs:223-233 | datafusion/ffi/src/catalog_provider_list.rs:187-197 | datafusion/ffi/src/schema_provider.rs:233-243 | datafusion/ffi/src/table_provider.rs:538-553 | datafusion/ffi/src/table_provider_factory.rs:91-101 | datafusion/ffi/src/udtf.rs:191-202 \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":"datafusion/ffi/src/catalog_provider.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac9ad44d9ab46a4d2db5908216b6d87ec0498598262474bbd1785ad9a52bc60"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): datafusion/functions-nested/src/string.rs:191-209 | datafusion/functions/src/crypto/digest.rs:58-74 | datafusion/functions/src/regex/regexplike.rs:69-86 | datafusion/functions/src/string/btrim.rs:77-96 | datafusion/functions/src/string/ltrim.rs:82-100 | datafusion/functions/src/string/rtrim.rs:82-100 \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":"datafusion/functions-nested/src/string.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a3b95510617b944197d0856a82f47f28ebed9dbdd8e7f475d050ca44354215"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): datafusion/functions/src/math/abs.rs:162-175 | datafusion/functions/src/math/monotonicity.rs:331-344 | datafusion/functions/src/math/monotonicity.rs:434-445 | datafusion/functions/src/math/monotonicity.rs:472-483 | datafusion/functions/src/math/monotonicity.rs:510-521 | datafusion/functions/src/math/monotonicity.rs:637-648 \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":"datafusion/functions/src/math/abs.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2d274f4619663ad8e1346313c389cffafb0f92699a22f95f888baa6d165ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): datafusion/datasource/src/memory.rs:697-767 | datafusion/physical-plan/src/joins/asof_join.rs:659-745 | datafusion/physical-plan/src/joins/hash_join/exec.rs:2246-2370 | datafusion/physical-plan/src/joins/nested_loop_join.rs:993-1036 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:951-1043 \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":"datafusion/datasource/src/memory.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"836b6d44919093c8bb9e597210f40f36327c3074c6dbdd67aea845884508f3f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): datafusion/catalog-listing/src/helpers.rs:45-127 | datafusion/expr/src/utils.rs:261-312 | datafusion/optimizer/src/push_down_filter.rs:247-289 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:622-699 \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":"datafusion/catalog-listing/src/helpers.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ea0d9769cdce82bf799416af643e4d1e64955434388f041a3ba1d4f2bad991"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): datafusion/common/src/scalar/mod.rs:4735-4746 | datafusion/common/src/scalar/mod.rs:4754-4765 | datafusion/common/src/scalar/mod.rs:4773-4784 | datafusion/common/src/scalar/mod.rs:4792-4803 \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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":4735}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf2e009f8c7cd724052773cc7d02bfef1e3e392c227693560e6aabcbd0d590c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): datafusion/ffi/src/udaf/accumulator.rs:93-105 | datafusion/ffi/src/udaf/accumulator.rs:167-179 | datafusion/ffi/src/udwf/partition_evaluator.rs:100-119 | datafusion/ffi/src/udwf/partition_evaluator.rs:125-144 \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":"datafusion/ffi/src/udaf/accumulator.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"26879ea7cd09e65cf6416ca49f8b6e242ccad3dcccb8fd1bdd16ff00fe8f4142"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:202-217 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:282-297 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:375-390 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:469-484 \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":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4b4a69689a96e71ee80bc44b825a2bf20de0da60f3d9c3c956aa4cdf227037"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): datafusion/functions-aggregate/src/covariance.rs:280-303 | datafusion/functions-aggregate/src/covariance.rs:305-336 | datafusion/functions-aggregate/src/regr.rs:607-632 | datafusion/functions-aggregate/src/regr.rs:638-671 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/covariance.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56d4cf07c25a966147256be43cfa2ee011a4da21e58726dd39c7459a1027087"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): datafusion/physical-expr/src/aggregate.rs:743-757 | datafusion/physical-expr/src/aggregate.rs:841-906 | datafusion/physical-expr/src/aggregate.rs:911-924 | datafusion/physical-expr/src/aggregate.rs:931-944 \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":"datafusion/physical-expr/src/aggregate.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f4aac9301c8da4053430d735b2939097b59d37a1b55e399554074fe018801d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): datafusion/physical-plan/src/filter.rs:563-619 | datafusion/physical-plan/src/joins/asof_join.rs:257-293 | datafusion/physical-plan/src/joins/hash_join/exec.rs:1303-1360 | datafusion/physical-plan/src/joins/nested_loop_join.rs:381-438 \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":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"be77bee4f16c26544dd33372c7a4147ca870ec5719667bd178c5d5e3129d5b6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): datafusion/physical-plan/src/joins/asof_join.rs:473-530 | datafusion/physical-plan/src/joins/asof_join.rs:544-571 | datafusion/physical-plan/src/joins/hash_join/exec.rs:1688-1854 | datafusion/physical-plan/src/joins/nested_loop_join.rs:671-778 \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":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6e36c8227393d486160ce5c48c746a500f4d4896eb43260d0ec3f1c614954b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): datafusion/physical-plan/src/joins/asof_join.rs:576-650 | datafusion/physical-plan/src/joins/hash_join/exec.rs:2124-2237 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:854-938 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:661-778 \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":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65bd9426366c51b1bda173aa65a6bb2a46ab0beaeb41b65a84ea77913518e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (131 corresponding lines): datafusion/common/src/scalar/mod.rs:534-664 | datafusion/common/src/scalar/mod.rs:669-850 \u2014 These two members are one piece of code written twice and then edited apart: 131 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"18377d5d824d33c5155e5e22b24648be09d84ff196a1c7c2d32b3f485f4f2a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): datafusion/common/src/scalar/mod.rs:5399-5472 | datafusion/common/src/scalar/mod.rs:5488-5565 \u2014 These two members are one piece of code written twice and then edited apart: 74 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":5399}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c12b5453310d6e330e70de51492d25bf6ee27f11d9c294318ab75d95075dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): datafusion/common/src/hash_utils.rs:1212-1305 | datafusion/common/src/hash_utils/build_hasher.rs:403-468 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1a339f72b6a43d9117d81f41988d243001591af14ca5cf72a8d793a75b6e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (116 corresponding lines): datafusion/functions/src/math/ceil.rs:84-199 | datafusion/functions/src/math/floor.rs:130-245 \u2014 These two members are one piece of code written twice and then edited apart: 116 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/ceil.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb177824a71f57377f66e55ed4531f0d359a01a48a1bf64744c74b134fe4e48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): datafusion/functions/src/datetime/make_date.rs:97-152 | datafusion/functions/src/datetime/make_time.rs:98-160 \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":"datafusion/functions/src/datetime/make_date.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe5ab66c719bab5c7b62cc2f18b699abbded9bba58927a19fb08ef3a1603851"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs:438-505 | datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs:1100-1218 \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":"datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"019ce75b1a4ee8406f0acda87cd098151b3f77aab7c1e35a2db5dddaf5645018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (82 corresponding lines): datafusion/functions-nested/src/extract.rs:590-671 | datafusion/functions-nested/src/extract.rs:681-764 \u2014 These two members are one piece of code written twice and then edited apart: 82 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/extract.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90dec2e0e579bb0d428a6bd7c9f22cf06e0ad158c6b50a7483834f2c7d89a11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): datafusion/physical-plan/src/windows/proto.rs:31-97 | datafusion/proto/src/physical_plan/to_proto.rs:90-168 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/proto.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a16352334972ea3675efbeda1fc3dbc4486027c2ebb27eca5a0b92fb092498"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): datafusion/expr/src/logical_plan/plan.rs:1707-1741 | datafusion/expr/src/logical_plan/plan.rs:1748-1781 \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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"217f1fe375154228613bc63490d273300f6110f46858787e99a0c7f91032bbc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): datafusion/expr-common/src/signature.rs:924-977 | datafusion/expr-common/src/signature.rs:986-1046 \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":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df4f3bc0213c170b226bf6abb78df069ed159531d5cb770c6b8deb5e29295c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): datafusion/physical-plan/src/aggregates/clustered_single_stream.rs:146-210 | datafusion/physical-plan/src/aggregates/single_stream.rs:148-213 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/clustered_single_stream.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"39796846baa8cefd4359108583c149f3a2288014eecf51d366a3d5ae52afabc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): datafusion/physical-expr/src/equivalence/properties/mod.rs:1154-1191 | datafusion/physical-expr/src/equivalence/properties/mod.rs:1198-1235 \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":"datafusion/physical-expr/src/equivalence/properties/mod.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e85a0ebf391506add9bfdab5644f2c3a243e0114080203b465bb30da7ff076d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): datafusion/functions-nested/src/array_has.rs:659-705 | datafusion/functions-nested/src/array_has.rs:712-757 \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":"datafusion/functions-nested/src/array_has.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d72ed39b92baebab77346f868d095b9671f74be72fa3b712825ffdecd99004"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): datafusion/functions-nested/src/reverse.rs:136-182 | datafusion/functions-nested/src/reverse.rs:192-249 \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":"datafusion/functions-nested/src/reverse.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe2de00677b8a0466ee4a3e8fb58d4445121299f916326cefa8462908a6fd77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): datafusion/common/src/hash_utils.rs:493-545 | datafusion/common/src/hash_utils/build_hasher.rs:336-395 \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":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"356701e53f900f4679072f263ec2764163e8d89ce27e4c874e6ce14829906e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): datafusion/functions/src/string/split_part.rs:235-303 | datafusion/functions/src/unicode/substrindex.rs:178-242 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/split_part.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d451d755258fb64e3cfa1bcfc820149751a16b3f128742d177e76acc86e9a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): datafusion/physical-expr/src/expressions/case/literal_lookup_table/bytes_like_lookup_table.rs:72-131 | datafusion/physical-expr/src/expressions/case/literal_lookup_table/bytes_like_lookup_table.rs:135-210 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/case/literal_lookup_table/bytes_like_lookup_table.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfd99263c004a7b7f4c60fb8f139344438191b36bd5ceb75da207b9a8fc4177"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): datafusion/core/src/execution/session_state.rs:238-272 | datafusion/core/src/execution/session_state.rs:2066-2097 \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":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6177747369034d4b903025134bc4d1cc6d983d86493ea6bb62df5b7d6109403"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): datafusion/datasource/src/file_scan_config/mod.rs:1443-1513 | datafusion/datasource/src/file_scan_config/mod.rs:1522-1589 \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":"datafusion/datasource/src/file_scan_config/mod.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"538d03c1d8571216b235528d1c92fd66b21f2636e434fe00c2e26ddbc075e648"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs:139-194 | datafusion/physical-plan/src/aggregates/aggregate_hash_table/common_clustered.rs:177-225 \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":"datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cbea4e12e3ba8f0c9977edef3fc09b70c68afb5b77e784d620cd079eb3b93d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:419-457 | datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs:372-416 \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":"datafusion/physical-plan/src/aggregates/clustered_final_stream.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9b6c0acfed4b6b837933206e3d7100285ab973b7bb1021bb91c7bb58a7102e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): datafusion/functions-aggregate/src/first_last.rs:1482-1522 | datafusion/functions-aggregate/src/first_last.rs:1870-1908 \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":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee5d97645bf6fd7effdb7cf3e231bfb691fbb2dcf8803be9f0a7b02ceba34cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): datafusion/catalog/src/async.rs:258-304 | datafusion/catalog/src/async.rs:330-397 \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":"datafusion/catalog/src/async.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a864b273d36678d64543beff1a1e5cc0db2e2c6ebf60761368eea1728c782915"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): datafusion/functions-aggregate/src/planner.rs:23-102 | datafusion/functions-window/src/planner.rs:23-113 \u2014 These two members are one piece of code written twice and then edited apart: 80 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/planner.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8805e3fc84b9cabc93adec83756fef3429d5e96109d62d0329a461b26810bd55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): datafusion/physical-plan/src/repartition/range.rs:396-430 | datafusion/physical-plan/src/repartition/range.rs:452-494 \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":"datafusion/physical-plan/src/repartition/range.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fcdffc31d2e88ef4662fa2216a5ade2edb1065b1509859da3a974e28fbff5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs:102-148 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/primitive.rs:196-243 \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":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebc0a95071f9fbab32d89ca1b5d556d96cfc2c5bc03b58b790738ca71dddfc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): datafusion/functions/src/math/cot.rs:84-126 | datafusion/functions/src/math/signum.rs:86-134 \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":"datafusion/functions/src/math/cot.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b58275ad7aaa658922881e0f7eff2f5a556fb27ceaab12429545950082bf5f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): datafusion/functions-nested/src/position.rs:130-178 | datafusion/functions-nested/src/position.rs:432-473 \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":"datafusion/functions-nested/src/position.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4bdeb1f0dae5dd7884d88e87396fa42c5f4549a06524b41bed36f0aebc526a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): datafusion/common/src/hash_utils.rs:437-482 | datafusion/common/src/hash_utils/build_hasher.rs:290-328 \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":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d61efd63b28c88dae02a635b2bc7236dd33fc472a99e59138742ccf3cc28601"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): datafusion/expr-common/src/interval_arithmetic.rs:1576-1608 | datafusion/expr-common/src/interval_arithmetic.rs:1689-1721 \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":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1acffb97cb9a7587dd3247aade318b793d1bc72a4fd1aae6a493370b0b7acce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): datafusion/sql/src/unparser/dialect.rs:914-947 | datafusion/sql/src/unparser/dialect.rs:1137-1170 \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":"datafusion/sql/src/unparser/dialect.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c359b900e8beba3253114603fe677d8bb9055c4d9f431c1f0b2b8f193850e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): datafusion/functions-aggregate-common/src/min_max.rs:735-786 | datafusion/functions-aggregate-common/src/min_max.rs:813-864 \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":"datafusion/functions-aggregate-common/src/min_max.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"4753105db1e4c9667894ac552b296157221d137bc81fa3dfd4130065d0bd876f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): datafusion/physical-plan/src/aggregates/hash_stream.rs:285-347 | datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs:153-200 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/hash_stream.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcef3ffd672148a321dd410be674ee6193a48727ad00ec48f44bd26ab3d45b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): datafusion/common/src/hash_utils.rs:791-833 | datafusion/common/src/hash_utils.rs:889-918 \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":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cc3ac3274f1a99ecf07488e4c6bccec672106d4109cd2871943fefd18f756e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): datafusion/functions/src/unicode/substr.rs:327-371 | datafusion/functions/src/unicode/substr.rs:376-404 \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":"datafusion/functions/src/unicode/substr.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc4a114d9c2c00d17bb1ab866d3fd8cadd56dbac81c627e7ea559ad937bbcf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): datafusion/functions-aggregate/src/first_last.rs:1548-1582 | datafusion/functions-aggregate/src/first_last.rs:1935-1971 \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":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01186f5d7ae7b54070252008bfa5a6065366964b3c2a3538ae6c760ccb3bcfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): datafusion/physical-plan/src/aggregates/mod.rs:2588-2625 | datafusion/proto/src/physical_plan/to_proto.rs:34-67 \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":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c8808503b19f3ffdb3ed90d56fd4e2274948456880baa7632f6332a5d612c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:268-300 | datafusion/physical-plan/src/aggregates/single_stream.rs:263-295 \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":"datafusion/physical-plan/src/aggregates/clustered_final_stream.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f683c4eb0960bdc82a0f54593362a35ad43aa617e6e3d1fee7e02ea3396a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): datafusion/datasource/src/file_compression_type.rs:115-141 | datafusion/datasource/src/file_compression_type.rs:210-241 \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":"datafusion/datasource/src/file_compression_type.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bcf07c89158dabee310d0bcc0d72dfb5bab2832ede70bcf2f3457dbd83552a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): datafusion/functions/src/math/round.rs:171-209 | datafusion/functions/src/math/trunc.rs:67-104 \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":"datafusion/functions/src/math/round.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f72b6adfa973d0c894ad6a1c5fdab21811590685e3499986040a9fc7fdb2c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): datafusion/functions/src/core/overlay.rs:254-293 | datafusion/functions/src/unicode/translate.rs:185-218 \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":"datafusion/functions/src/core/overlay.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c322103305cb00358ab1e157d75472d0d43002440571b5263f3dc781a198fae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs:138-179 | datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs:98-139 \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":"datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44baee42f20779c7d99066a95f3123fe0ff629b745583817345ac82bafa3f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): datafusion/common/src/hash_utils.rs:386-417 | datafusion/common/src/hash_utils/build_hasher.rs:200-231 | datafusion/common/src/hash_utils/build_hasher.rs:243-276 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa5f5ba00e32505996f2d93ac67c54e4a56d504526bd77d557c55b1d3be6758"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 48\u002B corresponding lines): datafusion/functions/src/datetime/to_timestamp.rs:523-570 | datafusion/functions/src/datetime/to_timestamp.rs:609-656 | datafusion/functions/src/datetime/to_timestamp.rs:695-742 | datafusion/functions/src/datetime/to_timestamp.rs:781-828 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 48 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/to_timestamp.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"1125f3251b911991ba7db6a832bc537c41c24d22ad55c3c7ea454130da05892f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): datafusion/expr/src/udaf.rs:1242-1297 | datafusion/expr/src/udaf.rs:1433-1484 \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":"datafusion/expr/src/udaf.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"47588ebdf59850fe78fa468efe675b873d3bda718b2f26b95a240e00279bb881"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): datafusion/physical-expr/src/expressions/cast.rs:745-790 | datafusion/physical-expr/src/expressions/try_cast.rs:244-282 \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":"datafusion/physical-expr/src/expressions/cast.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"93123fcef7b97e10152517d5a6e3d0a8d4d33fed7f6c399a965a4f56f08a5626"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): datafusion/functions-aggregate/src/percentile_cont.rs:287-326 | datafusion/functions-aggregate/src/percentile_cont.rs:332-359 \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":"datafusion/functions-aggregate/src/percentile_cont.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6869409c418f6eb1e7ec6c51d0dfe0bd7b2cf4cd1eced781f430e20b8938d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): datafusion/physical-plan/src/joins/nested_loop_join.rs:481-520 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:440-479 \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":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"644a9f1e1bc8804609c2a4a8851865f5f108a77b846a8ff6ec15d0f47588ec75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): datafusion/functions-nested/src/replace.rs:119-150 | datafusion/functions-nested/src/replace.rs:227-270 | datafusion/functions-nested/src/replace.rs:345-376 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/replace.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14bcd7a9c18b874a5ec02d81cb9bd3ed5a536f4ffa29e27f65ee0f99244599a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): datafusion/functions/src/math/round.rs:645-674 | datafusion/functions/src/math/round.rs:683-708 \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":"datafusion/functions/src/math/round.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aef7001016991c1a7372ecedc0495baae1a603ef7734ccc5a62b206e662cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): datafusion/expr-common/src/interval_arithmetic.rs:1995-2019 | datafusion/expr-common/src/interval_arithmetic.rs:2035-2059 \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":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4d61d758b15c851f1c5ba22ef59ad5881b3dc18c23114224f8c73ad273c03f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): datafusion/expr-common/src/signature.rs:407-443 | datafusion/expr-common/src/signature.rs:449-487 \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":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c21ba93cd928cf2e5e5d429eb7d1ad6a18db7fe2554f1af210271451f6612f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): datafusion/functions-nested/src/array_avg.rs:124-161 | datafusion/functions-nested/src/array_product.rs:128-161 | datafusion/functions-nested/src/array_sum.rs:124-161 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_avg.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02101ca20fb60051668172be3aaf24eddcd4d2e9b3e83630fa2e85a2c86e131"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): datafusion/physical-plan/src/spill/in_progress_spill_file.rs:59-100 | datafusion/physical-plan/src/spill/in_progress_spill_file.rs:103-152 \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":"datafusion/physical-plan/src/spill/in_progress_spill_file.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"72738596c9692602faeb7a4e8415961cde87b144e2b6745712b7f3de60beb178"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs:532-565 | datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs:568-599 \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":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9f61c5c816a7cfdbd1fa2399506d46a31b88b39f35317e620f45a46e2a8211"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/expr-common/src/type_coercion/binary.rs:971-988 | datafusion/expr-common/src/type_coercion/binary.rs:1021-1040 \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":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b4358ba7170d40bcb34d1440b2d164ffdbc30fae864736a3922f9e2243d536"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): datafusion/functions/src/string/btrim.rs:22-40 | datafusion/functions/src/string/ltrim.rs:23-41 | datafusion/functions/src/string/rtrim.rs:23-41 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/functions/src/string/btrim.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ba2c63338b6b7944bf1bdc28f3397a38c09b22bfef4ef192a82218ad309b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): datafusion/core/src/dataframe/mod.rs:2321-2363 | datafusion/core/src/dataframe/mod.rs:2391-2433 \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":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b3f8a45f7e9a1555b9646a2d0b61a25175ced06d4a2629f282826fba948591"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): datafusion/physical-plan/src/joins/asof_join.rs:1135-1163 | datafusion/physical-plan/src/joins/asof_join.rs:1165-1196 \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":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d441bf421cf24be393e7e4049cc624fa7697d893a241a8e1c8caff90f9aeb371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): datafusion/sqllogictest/src/engines/datafusion_engine/runner.rs:133-165 | datafusion/sqllogictest/src/engines/datafusion_substrait_roundtrip_engine/runner.rs:87-124 \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":"datafusion/sqllogictest/src/engines/datafusion_engine/runner.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f0acde73990147fde239f1ae85cb178885e497412472d69c8f067afc05cdba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): datafusion/common/src/hash_utils.rs:149-181 | datafusion/common/src/hash_utils/build_hasher.rs:45-80 \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":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5291be030f308684b678667f44e0593edbc9def27a0d271436dcd6450ac597"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): datafusion/core/src/execution/context/mod.rs:1356-1380 | datafusion/core/src/execution/context/mod.rs:1398-1431 \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":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b805696a5250aec307e3165972446ae5e187fb989fdaa0ae14003d4deee6c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): datafusion/physical-expr/src/expressions/cast.rs:835-891 | datafusion/physical-expr/src/expressions/try_cast.rs:316-356 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/cast.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3376130d000ec69769025e65877415c32953a64e0573474320138254e9efd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/functions-aggregate/src/nth_value.rs:237-259 | datafusion/functions-aggregate/src/nth_value.rs:409-435 \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":"datafusion/functions-aggregate/src/nth_value.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ba6b3f5a0bba83cfdf3ce1a429dd88959a41fe4b72f661375216232898d85c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): datafusion/functions/src/string/common.rs:493-525 | datafusion/functions/src/string/common.rs:540-573 | datafusion/functions/src/unicode/initcap.rs:147-183 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/functions/src/string/common.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"024568fc2c3dc85a58309e5766cec92fb98c35497f63c1382c7ac19d8468898b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): datafusion/functions/src/core/arrow_cast.rs:146-181 | datafusion/functions/src/core/arrow_try_cast.rs:119-151 \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":"datafusion/functions/src/core/arrow_cast.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f140ab42a613e95a897d3adb3fa1e92bf15deaafda6f2a6af340bdecbaec29f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): datafusion/sql/src/parser.rs:1055-1082 | datafusion/sql/src/parser.rs:1130-1164 \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":"datafusion/sql/src/parser.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a0d44579013e7b3dce4391e3ecd5bb6977623fc2bb1e2181aa09a314c558df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): datafusion/functions-aggregate/src/approx_median.rs:77-105 | datafusion/functions-aggregate/src/approx_percentile_cont.rs:237-278 \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":"datafusion/functions-aggregate/src/approx_median.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d17c4ca5e34ca06ecb59f81e0c896fd828f439eaa90c5b45b03893f060d8b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): datafusion/ffi/src/udaf/mod.rs:382-416 | datafusion/ffi/src/udf/mod.rs:284-312 | datafusion/ffi/src/udwf/mod.rs:213-238 \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":"datafusion/ffi/src/udaf/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf95cac79eada1db738c056cddbfa7496b093940bb8c5b7d74f92b4b7e58854"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:364-400 | datafusion/physical-plan/src/windows/window_agg_exec.rs:160-188 \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":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd347245bee299a43c6a4ee9af10ab82bc28f559050ef9dd25894bffa9f56fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): datafusion/physical-expr/src/expressions/cast.rs:302-339 | datafusion/physical-expr/src/expressions/try_cast.rs:151-183 \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":"datafusion/physical-expr/src/expressions/cast.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d808e9b77b4d784b5bf670706660792444269b94d8090388564aa6c0d3c1bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): datafusion/datasource-csv/src/file_format.rs:930-965 | datafusion/datasource-json/src/file_format.rs:563-600 | datafusion/datasource-parquet/src/sink.rs:548-582 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 35 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-csv/src/file_format.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0120beb7389398955eb19fa9dcb2dac92a50b841e2d235cb7bb500f89f4b554"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): datafusion/functions/src/encoding/inner.rs:453-476 | datafusion/functions/src/encoding/inner.rs:487-508 \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":"datafusion/functions/src/encoding/inner.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a136f134f56f90fc1906bf78cb897550afd671ca92939f003272b38e30f86f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): datafusion/ffi/src/proto/logical_extension_codec.rs:300-329 | datafusion/ffi/src/proto/physical_extension_codec.rs:286-315 \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":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dcde11b3764376ecdc1f480bbab10b11558194a0e1805470f49df4461510f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/functions-aggregate/src/correlation.rs:172-192 | datafusion/functions-aggregate/src/correlation.rs:270-285 \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":"datafusion/functions-aggregate/src/correlation.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3bdb5076b12206862fa3b0f407bbf01aa2a7371b22df4389e5e4a9158dd628"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/expr/src/logical_plan/information_schema.rs:721-740 | datafusion/expr/src/logical_plan/information_schema.rs:833-850 \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":"datafusion/expr/src/logical_plan/information_schema.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1027a4b7e16221df814713418b9fbe5bc782d2009fa055728a18021c82054c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/common/src/stats.rs:890-910 | datafusion/common/src/stats.rs:918-938 \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":"datafusion/common/src/stats.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25644bc8b36393f0ac4f505ec6424fdb698123b16321b3944a1ae13e4e7d3cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): datafusion/functions-aggregate/src/variance.rs:86-110 | datafusion/functions-aggregate/src/variance.rs:189-215 \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":"datafusion/functions-aggregate/src/variance.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aba8d60c2791ad62d16a636c781d2e113d85389a2c8f17d24df02dc5e079b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/functions/src/core/arrow_cast.rs:116-136 | datafusion/functions/src/core/arrow_try_cast.rs:88-109 \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":"datafusion/functions/src/core/arrow_cast.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"368f68c2ae3c84ef630046992937331fa41b056bd018c16dad88afaf76931c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): datafusion/expr-common/src/type_coercion/binary.rs:2116-2135 | datafusion/expr-common/src/type_coercion/binary.rs:2153-2182 \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":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3bb64fa485c39457ca8fede3906c6eb34daa436d671483ab41f939ad72511d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): datafusion/functions-aggregate/src/min_max.rs:252-280 | datafusion/functions-aggregate/src/min_max.rs:485-513 \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":"datafusion/functions-aggregate/src/min_max.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"78acd943396cf9092d97ff85c9f2c7fdf57b204ca61acd908ad5712cf367a8e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): datafusion/datasource-csv/src/file_format.rs:855-878 | datafusion/datasource-json/src/file_format.rs:486-509 | datafusion/datasource-parquet/src/sink.rs:417-445 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/datasource-csv/src/file_format.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"327d6f2194d6ff62303106d3b2a714414293163c91b38b7c6889514e62fcd6d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): datafusion/functions/src/crypto/basic.rs:94-109 | datafusion/functions/src/crypto/basic.rs:117-140 | datafusion/functions/src/crypto/basic.rs:148-171 \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":"datafusion/functions/src/crypto/basic.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8949b3c161d59556f7fd51abbf2ced4bc3e516a082683ea4fb5b89682baf83d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): datafusion/proto-common/src/from_proto/mod.rs:801-836 | datafusion/proto-common/src/from_proto/mod.rs:840-869 \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":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"62def680cc3a4f263e7fe20200cb08c44bba122d4dde2ab3037b9e25c577cf6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:650-680 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:464-491 \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":"datafusion/physical-plan/src/joins/sort_merge_join/exec.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"5565b05e2e88a7b9c4f8a8116f8f61360d11c335663f935e8e3c38221e68fa5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/ffi/src/physical_expr/mod.rs:263-287 | datafusion/ffi/src/physical_expr/mod.rs:313-335 \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":"datafusion/ffi/src/physical_expr/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"02636b60032899c6b9ac59bdff6a5a39055cc5f5d6e533d04ad4b8c91cd613b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/functions-nested/src/remove.rs:105-125 | datafusion/functions-nested/src/remove.rs:344-367 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/remove.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"852d6502b7446184c3d3d1d87661e7421600bd8d43ddac8455f4f424dde68829"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): datafusion/sql/src/expr/mod.rs:1154-1178 | datafusion/sql/src/expr/mod.rs:1188-1209 \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":"datafusion/sql/src/expr/mod.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"54126cf91f4469462d9c93652b48ed5946e79d6001a27b4b85b8c1471df2a21b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): datafusion/expr/src/udaf.rs:1055-1109 | datafusion/expr/src/udaf.rs:1156-1192 | datafusion/expr/src/udaf.rs:1345-1383 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/udaf.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"78037a5f80a9013ef1a633801b8e756be203d4322fca3907de05fc13d5a01cba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:2263-2283 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:2285-2307 \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":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"559b99c1004e066b11043c0c98b2bce4010bbcd00fac998f3d594a8acffaa01d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/physical-expr/src/intervals/cp_solver.rs:629-646 | datafusion/physical-expr/src/statistics/stats_solver.rs:128-145 \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":"datafusion/physical-expr/src/intervals/cp_solver.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65b3b7be47336dcaaabff45f2d7f803fd89cb51880f75c060ff7f86e46901b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1151-1186 | datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1352-1380 \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":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea34f71906028e603729e50d921b2aa857c867fb20ca1f2738fc242636daf39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/common/src/float_semantics.rs:192-209 | datafusion/physical-plan/src/sorts/sort.rs:1347-1369 \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":"datafusion/common/src/float_semantics.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c39520142d15057b2b500f966015c571d8478f3e5c1b1b8be5ebb6b0b6a58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): datafusion/expr-common/src/interval_arithmetic.rs:581-602 | datafusion/expr-common/src/interval_arithmetic.rs:606-627 \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":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ac6d2e9c347643b3d1fe94f4e9702967e5fc9bdaa914f66bc62fd315f85707"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): datafusion/physical-plan/src/aggregates/hash_stream.rs:469-498 | datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs:299-330 \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":"datafusion/physical-plan/src/aggregates/hash_stream.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e821d8ef27ac46976b57e10df1a7846113b2f02da03d13e71cc88e35693bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/functions-aggregate/src/average.rs:876-892 | datafusion/functions-aggregate/src/average.rs:957-972 \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":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"632259cbfff6959bfefc268595ba44ffb96ca6b8d5cd5d72e3cfbe9a2296abd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): datafusion/functions-aggregate/src/first_last.rs:321-340 | datafusion/functions-aggregate/src/first_last.rs:1648-1667 \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":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fb5de0b1d33633d22c179fb2dfb620ed0a83901bd644ce7c6cebb8f48761ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): datafusion/core/src/execution/context/mod.rs:1178-1209 | datafusion/core/src/execution/context/mod.rs:1211-1237 \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":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f134ad082f94159cec32a381436101c3f7568f62c20c45b33fd6baca8ee2e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/functions/src/strings.rs:957-982 | datafusion/functions/src/strings.rs:985-1007 \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":"datafusion/functions/src/strings.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19c4beec9a965bbb40ff1c48ff6c1259f567697c21ea519aea2ae53cd0a43b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): datafusion/physical-plan/src/async_func.rs:271-300 | datafusion/physical-plan/src/windows/window_agg_exec.rs:347-396 \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":"datafusion/physical-plan/src/async_func.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb420373ea52d1b32d66451393968bc78c68f5bf2ba0beae62844adf4c1203ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs:75-100 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/primitive.rs:112-135 \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":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"24db054344571fed4c38eae6030145b3eafa7919c8b29286d64e3d5ac1808897"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): datafusion/expr/src/expr.rs:802-831 | datafusion/physical-expr/src/expressions/binary.rs:195-224 | datafusion/physical-expr/src/expressions/binary.rs:947-971 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de92d07357c80df30f598375873111fa8f12aec7b2b3bb193ae34231c708243"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/functions-aggregate/src/correlation.rs:105-122 | datafusion/functions-aggregate/src/regr.rs:480-516 \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":"datafusion/functions-aggregate/src/correlation.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bc75801971d64c207479b770110905d01a56edfbb060d6fa829ae6b97690c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): datafusion/physical-plan/src/unnest.rs:283-313 | datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:510-536 \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":"datafusion/physical-plan/src/unnest.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8fc7b56fc15555c4f471be8cc6e5b5f48249914401c5aad46cfc59cc2b539c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/expr-common/src/interval_arithmetic.rs:978-1000 | datafusion/expr-common/src/interval_arithmetic.rs:1015-1031 \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":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ec03cde1688e330c0be5c39ae756b3d8fcadf1a0ed128bf3f52ee884eeaeef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): datafusion/physical-plan/src/coalesce_partitions.rs:73-99 | datafusion/physical-plan/src/sorts/sort_preserving_merge.rs:151-179 \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":"datafusion/physical-plan/src/coalesce_partitions.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c48300a17c231fb5934871242027d73e21a61c288184759bf73e1b7994ee6ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/functions/src/strings.rs:1256-1272 | datafusion/functions/src/strings.rs:1275-1291 \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":"datafusion/functions/src/strings.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59db507b730f597e7ada50bac825d4758d448fd934528bae7bb307754c023b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): datafusion/datasource-avro/src/source.rs:208-233 | datafusion/datasource-json/src/source.rs:319-355 \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":"datafusion/datasource-avro/src/source.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e4dfc3b7887f2b42c91457d607b53f47333bb802e170da5d4636c5bca249a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): datafusion/ffi/src/physical_expr/mod.rs:613-634 | datafusion/ffi/src/physical_expr/mod.rs:655-677 \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":"datafusion/ffi/src/physical_expr/mod.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e7f01f69549269f16b7287a150f56dcbb4810981e86d0d9b692570a0b5603d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): datafusion/functions/src/datetime/current_date.rs:98-121 | datafusion/functions/src/datetime/current_time.rs:95-119 \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":"datafusion/functions/src/datetime/current_date.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"365a444ede394d5fd142a855ba0bea13fc3882861c8060eb63266f2b5706c1d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): datafusion/physical-plan/src/aggregates/topk/hash_table.rs:588-606 | datafusion/physical-plan/src/aggregates/topk/heap.rs:595-613 \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":"datafusion/physical-plan/src/aggregates/topk/hash_table.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c42975f89c99d71b0b93a2a5f5510c2d53af7f47ec3eba6250fcedace5cebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): datafusion/functions/src/string/ascii.rs:166-185 | datafusion/functions/src/unicode/character_length.rs:101-120 \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":"datafusion/functions/src/string/ascii.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10cee6298ca640272fe28b133d40947b9c6bb10cab08a8bfc4cd7ab2a521ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): datafusion/physical-expr/src/expressions/cast.rs:689-717 | datafusion/physical-expr/src/expressions/try_cast.rs:210-235 \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":"datafusion/physical-expr/src/expressions/cast.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cd07e57d9f0a9c691fcef2606c9ecfbfec24538fac3445960c5059d00b9be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): datafusion/ffi/src/udaf/accumulator_args.rs:40-71 | datafusion/ffi/src/udaf/accumulator_args.rs:93-118 \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":"datafusion/ffi/src/udaf/accumulator_args.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec5f9f25c5dad4311d65f4c64f71ac400a1360ae298d930a7485abf3175112f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): datafusion/functions/src/core/greatest.rs:84-108 | datafusion/functions/src/core/least.rs:97-121 \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":"datafusion/functions/src/core/greatest.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7899ea3bfe699c908c2b9ca065928c01f169159132d01bce16363f8a48de5c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): datafusion/expr-common/src/interval_arithmetic.rs:464-489 | datafusion/expr-common/src/interval_arithmetic.rs:498-523 \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":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"5116f770d09e1cdb3d31eeb2ae694127ae1bd4906b1ce46c63535b6ae6212b55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/functions/src/unicode/strpos.rs:215-239 | datafusion/functions/src/unicode/strpos.rs:296-318 \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":"datafusion/functions/src/unicode/strpos.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb22e9aefd34c8bd67dc37d21d72751ba0b55ce9d35923bc0723457ec71165aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): datafusion/ffi/src/udaf/groups_accumulator.rs:297-321 | datafusion/ffi/src/udaf/groups_accumulator.rs:380-407 \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":"datafusion/ffi/src/udaf/groups_accumulator.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea087824b620f657ed185d6df75d2d6a52fdd2743e6ee88f7c6637dd8055c0eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): datafusion/functions-nested/src/extract.rs:425-458 | datafusion/functions-nested/src/extract.rs:463-487 \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":"datafusion/functions-nested/src/extract.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b846c5d9a4f25d4d61e4d39b3d6e3d8263ef97750525f58dcbbdfae45f46eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/expr-common/src/interval_arithmetic.rs:1524-1539 | datafusion/expr-common/src/interval_arithmetic.rs:1636-1651 \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":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd569787359b9e8762f318261700e73038b44ebc6aa656167fbe5849bb43751"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/sql/src/unparser/expr.rs:676-696 | datafusion/sql/src/unparser/expr.rs:1817-1838 \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":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe61ac92c35ae5f8ef95e3c0e39528c88fa219bede9839461c480f286b208bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/catalog/src/memory/table.rs:607-629 | datafusion/catalog/src/memory/table.rs:813-843 \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":"datafusion/catalog/src/memory/table.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f249121a99fa9ced9c89335e8d553b4fb634dc79c60b549fee3c1258b8c118"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/ffi/src/udaf/accumulator.rs:193-216 | datafusion/ffi/src/udaf/groups_accumulator.rs:226-248 \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":"datafusion/ffi/src/udaf/accumulator.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a714631f495fab03752b5aa70d510f42fa45f106b0c9d33f66cf08bd43371a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:392-410 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:486-504 \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":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e142ac452bf5cd90866569afa33628a29d4b83ace487c6640f8da23a31f0be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): datafusion/physical-plan/src/aggregates/aggregate_stream.rs:562-589 | datafusion/physical-plan/src/aggregates/mod.rs:3150-3174 \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":"datafusion/physical-plan/src/aggregates/aggregate_stream.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7d0ce8b20872d9dc003eb4b4e3ce97c288c559caca0797e93940bceb83782f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/functions-aggregate/src/first_last.rs:1373-1397 | datafusion/functions-aggregate/src/first_last.rs:1765-1787 \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":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a755e13e7ddc82ca9022799a1107e2d933e642e23548e724deed6b0923bc10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/functions-nested/src/array_add.rs:104-118 | datafusion/functions-nested/src/array_subtract.rs:103-117 \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":"datafusion/functions-nested/src/array_add.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e7bc9a19b351d6f87014c828051b3d5efcecb4e4234c0675f5cf6559e3f605"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): datafusion/functions/src/regex/regexpcount.rs:120-144 | datafusion/functions/src/regex/regexpinstr.rs:138-164 \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":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0caed940d93f58ed9f6c1e77c22b9d4b5b52a0c541a14eb14751b21e20b4b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/physical-plan/src/spill/in_progress_spill_file.rs:173-193 | datafusion/physical-plan/src/spill/in_progress_spill_file.rs:196-216 \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":"datafusion/physical-plan/src/spill/in_progress_spill_file.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac97fc9ebc792c006943574e0a0f982ce7893eff0314710b267a722971aa980"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/physical-expr-common/src/physical_expr.rs:870-896 | datafusion/physical-expr-common/src/sort_expr.rs:379-396 \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":"datafusion/physical-expr-common/src/physical_expr.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab042e0b5e6ab1727894bee766545d4f6556ec1f29f1533bc0e4adaeb20d5a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs:897-929 | datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs:936-965 \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":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"be431a9b95ede703b519f38918e354a01e69f35660c710e04a93970c0ce48be9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): datafusion/expr/src/logical_plan/invariants.rs:61-83 | datafusion/expr/src/logical_plan/invariants.rs:117-136 \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":"datafusion/expr/src/logical_plan/invariants.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfcd9621a1fb938102a63be37464b69ccfe4d03bc84c69750d57f3de33bac5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/ffi/src/udf/return_type_args.rs:29-55 | datafusion/ffi/src/udf/return_type_args.rs:74-96 \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":"datafusion/ffi/src/udf/return_type_args.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"343337188ffb9ff41b75bb37dcd1c3fb3523b332cc2d7c512ff13186ab8d25dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): datafusion/ffi/src/catalog_provider.rs:184-208 | datafusion/ffi/src/catalog_provider_list.rs:149-172 | datafusion/ffi/src/schema_provider.rs:192-218 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/ffi/src/catalog_provider.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae76ecf44dbede7633e2b6a46dc65365fb5ce1a72ac0355e49c2b0091748bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/ffi/src/catalog_provider.rs:312-329 | datafusion/ffi/src/schema_provider.rs:334-353 \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":"datafusion/ffi/src/catalog_provider.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea8876d93e55ebd882b8b2d404f81c7616beb8f5b8444d0a23d7a56110a2212"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/physical-plan/src/empty.rs:235-255 | datafusion/physical-plan/src/placeholder_row.rs:235-258 \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":"datafusion/physical-plan/src/empty.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"da46693c79c67a747a337ae0fae8a88f3df6d572c9c0645b7e5d990be61c0453"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): datafusion/functions/src/string/split_part.rs:362-385 | datafusion/functions/src/unicode/reverse.rs:134-160 | datafusion/functions/src/unicode/translate.rs:382-406 \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":"datafusion/functions/src/string/split_part.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9480d3a4b31b65f246d4cb94c734a5cd235f506180a06a4cc34cd7e42edbf407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/physical-expr-common/src/binary_view_map.rs:408-424 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes_view.rs:320-336 \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":"datafusion/physical-expr-common/src/binary_view_map.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f03d6cdceee99ac6f0db5b30707857e61b5375a26645922522109f81d9475f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/physical-plan/src/sorts/sort.rs:2065-2081 | datafusion/physical-plan/src/sorts/sort_preserving_merge.rs:432-450 \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":"datafusion/physical-plan/src/sorts/sort.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"955e30f370bc74c9a6ed47fd1b65fb3fd195e3d6f6eda1eaa60d37bfb7a70a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): datafusion/substrait/src/logical_plan/producer/expr/subquery.rs:36-66 | datafusion/substrait/src/logical_plan/producer/expr/subquery.rs:150-174 \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":"datafusion/substrait/src/logical_plan/producer/expr/subquery.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"be85dfe9eab0d307ecb7f4d437c9c6cf607d572d132d0ab8ef91465a73f04bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/functions/src/core/overlay.rs:59-74 | datafusion/functions/src/regex/regexpmatch.rs:62-80 \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":"datafusion/functions/src/core/overlay.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e42a85e5256e31f817488f46c54cfa217df94ec56fc01837b109bef1b013e37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/physical-expr/src/equivalence/properties/mod.rs:734-748 | datafusion/physical-expr/src/equivalence/properties/mod.rs:802-824 \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":"datafusion/physical-expr/src/equivalence/properties/mod.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae1981c51b9081b545db373214a984cba2672e58784355fa206305a47fa5f87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): datafusion/physical-plan/src/joins/symmetric_hash_join.rs:1741-1757 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:1771-1787 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:1802-1819 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:1834-1851 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/symmetric_hash_join.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8fedf75d365f77194f9a3c5d5f63d2b4b36015797c3f5f264144b51fe66e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/expr/src/logical_plan/information_schema.rs:705-718 | datafusion/expr/src/logical_plan/information_schema.rs:818-830 \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":"datafusion/expr/src/logical_plan/information_schema.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc2a61bfe3ea03b10784adab07b3dd1e839fb506f1cdc481ed0ec26c3c5b323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/functions-aggregate/src/nth_value.rs:286-302 | datafusion/functions-aggregate/src/nth_value.rs:497-513 \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":"datafusion/functions-aggregate/src/nth_value.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ee77e827b02183f3b886100077d099c8e12979978cc81d963e4caceb6f1f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/functions/src/encoding/inner.rs:199-219 | datafusion/functions/src/encoding/inner.rs:238-260 \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":"datafusion/functions/src/encoding/inner.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2806227b8ff59665865ac40690dba5bcf761c5fbc44ebbe82b8455bffb03b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): datafusion/common/src/config.rs:3666-3689 | datafusion/common/src/config.rs:3846-3867 \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":"datafusion/common/src/config.rs"},"region":{"startLine":3666}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a14b8d4444acb447cd0f3a0c9fd009ab9949877b91f27f47fc987c12b6b64a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/ffi/src/udtf.rs:259-277 | datafusion/ffi/src/udtf.rs:279-291 \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":"datafusion/ffi/src/udtf.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8830878f5e0e45116aa4b2def5533dc887bd35810aebfd0c401337b02f7477"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/proto-common/src/to_proto/mod.rs:751-770 | datafusion/proto-common/src/to_proto/mod.rs:774-789 \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":"datafusion/proto-common/src/to_proto/mod.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c346f5fd790af355c1b0f9a4ac57f0a15025bdb4dceb5d84a54a42c03cd17ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): datafusion/expr/src/utils.rs:1292-1311 | datafusion/expr/src/utils.rs:1316-1335 \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":"datafusion/expr/src/utils.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6bab28f001688917e4864acecd2749302564fbd02959b341b8c72007a1f942"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): datafusion/ffi/src/udaf/mod.rs:341-359 | datafusion/ffi/src/udf/mod.rs:155-169 | datafusion/ffi/src/udwf/mod.rs:148-166 \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":"datafusion/ffi/src/udaf/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d3f2e6cffceded88a81c9369883bdd8db41568a227fd0a7781c2b990b4406f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/common/src/hash_utils.rs:1054-1071 | datafusion/physical-plan/src/joins/hash_join/partitioned_hash_eval.rs:481-497 \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":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc4e5f31e954d44431fc75a7dc937bcf71909b25214fd7638df2d008e5e0ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 14\u002B corresponding lines): datafusion/common/src/stats.rs:131-144 | datafusion/common/src/stats.rs:149-162 | datafusion/common/src/stats.rs:167-180 | datafusion/common/src/stats.rs:224-238 | datafusion/common/src/stats.rs:268-281 | datafusion/common/src/stats.rs:286-300 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/stats.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bc62be948e95657395904dcfbc2805a438ac740f509c86be9a3dc5c7817df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/functions-nested/src/remove.rs:382-397 | datafusion/functions-nested/src/remove.rs:405-420 \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":"datafusion/functions-nested/src/remove.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec30e7adaffff9eaf5a5cae9a213370347dad430480d4054c974d97a5c32b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/physical-expr/src/intervals/cp_solver.rs:741-763 | datafusion/physical-expr/src/intervals/cp_solver.rs:777-797 \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":"datafusion/physical-expr/src/intervals/cp_solver.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0241ba585d7dff880d4eaef09ea7c7f4b0dbd320fc1e7f76e6001f0ae40f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs:200-224 | datafusion/physical-plan/src/aggregates/aggregate_hash_table/common_clustered.rs:234-256 \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":"datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bf4325fcb6d3c6b86562b5fc1ca4059f5a575682f9900afb94fa0199d60cbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 18\u002B corresponding lines): datafusion-cli/src/object_storage/instrumented.rs:169-187 | datafusion-cli/src/object_storage/instrumented.rs:193-210 | datafusion-cli/src/object_storage/instrumented.rs:297-314 | datafusion-cli/src/object_storage/instrumented.rs:316-333 | datafusion-cli/src/object_storage/instrumented.rs:339-356 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion-cli/src/object_storage/instrumented.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa3cf0b56d2c5dc4cee7a438a75db7c4e3a51ee3e152d684f910572b78d3e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/common/src/config.rs:2542-2566 | datafusion/execution/src/runtime_env.rs:552-572 \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":"datafusion/common/src/config.rs"},"region":{"startLine":2542}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffe107523bde46bf988d4b491f363ed6fcaac96ae747f9a79163c518f5b1aa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/expr/src/logical_plan/plan.rs:4096-4118 | datafusion/expr/src/logical_plan/plan.rs:4121-4143 \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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":4096}}}],"partialFingerprints":{"codehealthFindingId/v1":"438d633d359342aa24df22348d5f0cd1e242b07d842d2b240f9b4a9f3c81c805"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/common/src/utils/mod.rs:150-161 | datafusion/common/src/utils/mod.rs:200-211 \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":"datafusion/common/src/utils/mod.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d4198b7236ba6d1e8cba870d52209f1c651b86764c16eb935555581add2b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): datafusion/functions-aggregate/src/min_max/min_max_bytes.rs:509-531 | datafusion/functions-aggregate/src/min_max/min_max_struct.rs:297-315 \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":"datafusion/functions-aggregate/src/min_max/min_max_bytes.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff4cb03d2ce461274c5a51c8a29780f0b52683a41f5f8417b4b4d6981b650a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): datafusion/physical-expr/src/higher_order_function.rs:234-256 | datafusion/physical-expr/src/scalar_function.rs:194-213 \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":"datafusion/physical-expr/src/higher_order_function.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"31edfdaab11495327b6a46733cc7afa7b6f61775d48605aec32ae438a4c51553"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/substrait/src/logical_plan/consumer/substrait_consumer.rs:586-602 | datafusion/substrait/src/logical_plan/consumer/substrait_consumer.rs:608-623 \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":"datafusion/substrait/src/logical_plan/consumer/substrait_consumer.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"af173f0870bf78d49d59176da5ce3117b5d8ce38c060e610b248f06d4b0b8699"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): datafusion/datasource-arrow/src/file_format.rs:91-109 | datafusion/datasource-csv/src/file_format.rs:89-107 | datafusion/datasource-json/src/file_format.rs:78-96 | datafusion/datasource-parquet/src/file_format.rs:92-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 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":"datafusion/datasource-arrow/src/file_format.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b227457c3ae933e2dba7ec5f53c9f29abf10b7c5571f0029514d5eb95b6b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/functions-nested/src/map_keys.rs:95-110 | datafusion/functions-nested/src/map_values.rs:105-119 \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":"datafusion/functions-nested/src/map_keys.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bdf667ebb86bcd7606598f46109593c4d673c87bf1ea2775420f310b95aff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): datafusion/physical-plan/src/coalesce_partitions.rs:392-420 | datafusion/physical-plan/src/scalar_subquery.rs:272-308 \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":"datafusion/physical-plan/src/coalesce_partitions.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb40ad882fe378a837d9e9039fb789ea201ecef063545126eab5c3eaa91c9544"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/expr/src/logical_plan/tree_node.rs:917-934 | datafusion/expr/src/logical_plan/tree_node.rs:942-958 \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":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d8bc8c39c3d71da8937b2f1095422cc8a83a1dcf57615599ef48eb7d421b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/expr/src/logical_plan/tree_node.rs:1013-1035 | datafusion/optimizer/src/optimizer.rs:595-627 \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":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7bd70eed1f0b08ebe1d1ca21003ed12b4367ab79b8cd65e45ac71eba36685b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/expr/src/utils.rs:1516-1532 | datafusion/optimizer/src/decorrelate.rs:1206-1223 \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":"datafusion/expr/src/utils.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a09a1f43b1b143998c5b60ae9559891d51360b1989de7499edfcd0037b687c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 20\u002B corresponding lines): datafusion/physical-expr-common/src/binary_map.rs:376-403 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:225-244 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:246-267 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:275-304 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:306-326 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/binary_map.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c73db4b7b623ebeee66a42ab4f125418a45d8a6e50f51f274dc9ab385700e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 25\u002B corresponding lines): datafusion/functions-nested/src/extract.rs:302-328 | datafusion/functions-nested/src/resize.rs:72-96 | datafusion/functions-nested/src/sort.rs:87-115 | datafusion/functions-nested/src/string.rs:88-116 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/extract.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e501e04a223d0c5bfb2ee4a2f779f8c40881fd04b0701e2e560ec9a797dd47e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/expr-common/src/sort_properties.rs:52-71 | datafusion/expr-common/src/sort_properties.rs:73-88 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/sort_properties.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff99c54cbfb45ca82a4efa16ea4b729ccd11675e8efc76e2745c24735387f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): datafusion/ffi/src/table_provider.rs:718-733 | datafusion/ffi/src/table_provider.rs:739-752 \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":"datafusion/ffi/src/table_provider.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e828206eb4417460360fe164159be7a018261f15a02a2e0264e9cc434eba261"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/functions-aggregate/src/bool_and_or.rs:187-196 | datafusion/functions-aggregate/src/bool_and_or.rs:322-331 \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":"datafusion/functions-aggregate/src/bool_and_or.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"150cd1799d8758d61420b2113cb54e66dbc5bda778d782cafed92bfaba04b28b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): datafusion/physical-plan/src/empty.rs:202-226 | datafusion/physical-plan/src/placeholder_row.rs:202-226 \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":"datafusion/physical-plan/src/empty.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85b97b049420e7f06d1ce9702c361c84faf76185aa1ab813b0d6c500bb7d7b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): datafusion/expr-common/src/interval_arithmetic.rs:1063-1075 | datafusion/expr-common/src/interval_arithmetic.rs:1088-1100 | datafusion/expr-common/src/interval_arithmetic.rs:1113-1125 \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":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d897058694d555ef828fb25207127e811398ec1d66fad71f64f149a8749bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/physical-expr/src/intervals/cp_solver.rs:209-219 | datafusion/physical-expr/src/statistics/stats_solver.rs:89-104 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/intervals/cp_solver.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41d9a0f760ff97001d2e0b77be8f8be3840a2eefb6cd9b87860c8c752ea82e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): datafusion/expr/src/logical_plan/plan.rs:2010-2025 | datafusion/expr/src/logical_plan/plan.rs:2056-2071 | datafusion/expr/src/logical_plan/plan.rs:2076-2091 \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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"292bbded9010c1507461d51f74dbf96529b1bbdb5de4f5d9cd8d3e43bf779f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): datafusion/expr/src/type_coercion/functions.rs:1066-1086 | datafusion/expr/src/type_coercion/functions.rs:1094-1113 \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":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f80c2fa605cc8559d6a4fd3001dbfa3b49c43bf516ce1e840bc4d215f5e02c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): datafusion/functions-aggregate/src/average.rs:1141-1148 | datafusion/functions-aggregate/src/average.rs:1165-1172 | datafusion/functions-aggregate/src/variance.rs:514-521 \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":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffae8ef214f02f612f976f41699234c0fe9fb459f79e4736317fd189860cee2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/physical-expr/src/expressions/cast.rs:169-183 | datafusion/physical-expr/src/expressions/try_cast.rs:52-64 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/cast.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b987847cbc148ea02f85acfa6ade70c235989e1d0a19f2e94e14ae141d066e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): datafusion/datasource-arrow/src/source.rs:330-367 | datafusion/datasource/src/file.rs:179-197 \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":"datafusion/datasource-arrow/src/source.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a872d4c903a2c43b6c5911be4b6a892ea6e2f0eeb091d871fe6e8d781b1436"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/ffi/src/session/mod.rs:213-228 | datafusion/ffi/src/session/mod.rs:246-260 \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":"datafusion/ffi/src/session/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f0069f7734161e2a688ef60e839d7da5b4fb7ca17185b0daef0582506ed59f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:219-233 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:299-317 \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":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9164a40f8bd31befd5fd11a83dce80fe426626f4deb114b4c650760009673f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): datafusion/functions/src/core/cast_to_type.rs:112-128 | datafusion/functions/src/core/try_cast_to_type.rs:99-112 \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":"datafusion/functions/src/core/cast_to_type.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba3545713f94637279d504ce027713c140517e950b3e9b8647474249ab7ea20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:341-356 | datafusion/physical-plan/src/windows/window_agg_exec.rs:321-337 \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":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ec6b5749478b526902a89b114ca9f0f162d61704fd1c2da9a54c3850198ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/common/src/rounding.rs:161-178 | datafusion/common/src/rounding.rs:196-213 \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":"datafusion/common/src/rounding.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"febc40334bc88b1eedc908eacb05f632a39c9b0dea82f0ee46e2c2f32b9825c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/prim_op.rs:84-105 | datafusion/functions-aggregate/src/average.rs:1109-1132 \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":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/prim_op.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e35d0ba11044bf9235a58bdec50fd06156ebf89667c4cc5915e9050529d6d29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/functions-aggregate/src/average.rs:87-109 | datafusion/functions-aggregate/src/median.rs:69-91 \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":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d5ae5e373ed17dd5d465ee5e0551ee6b3c0d76e58cecdfddd49e59c6fd08f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): datafusion/functions-aggregate/src/first_last.rs:342-361 | datafusion/functions-aggregate/src/first_last.rs:1669-1688 \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":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"688b4189fbad61c7e031c97fb4ef66af7fc1eb49fbd30be3377ec825d2eeb38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/sql/src/unparser/plan.rs:433-450 | datafusion/sql/src/unparser/plan.rs:557-574 \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":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bca6af443719f3d291ca991173f8fd917dda91630dd6246376a5a0705f4e1b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/common/src/scalar/mod.rs:2675-2687 | datafusion/common/src/scalar/mod.rs:2693-2705 \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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":2675}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0c447fdd2f77b2d4f1676053298d928ee58acaa6c3ed31423c5bb25d155776"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): datafusion/common/src/scalar/mod.rs:3497-3515 | datafusion/common/src/scalar/mod.rs:3521-3539 | datafusion/common/src/scalar/mod.rs:3545-3563 | datafusion/common/src/scalar/mod.rs:3569-3587 \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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":3497}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ba41a29ec7ef2c08df9549a3d85ac493980356365c7f8cf389657dda12fc8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): datafusion/expr/src/logical_plan/builder.rs:366-387 | datafusion/expr/src/logical_plan/builder.rs:401-422 \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":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fa0eb3200963f02604dcba6a9ce58796bb221e74897501b72c616b00d7b9e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): datafusion/functions-aggregate/src/array_agg.rs:915-928 | datafusion/functions-aggregate/src/array_agg.rs:1331-1348 \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":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cf132eebd9a9dd3f50ea25af554bed8fead538a037cb93a2acabb93d8291c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): datafusion/functions-nested/src/map.rs:485-506 | datafusion/functions-nested/src/map.rs:513-534 \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":"datafusion/functions-nested/src/map.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"9399a2be15ee175d7363abda81c0eed5d6e157149f1fe1d7ddff7aacb5f79c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/functions-nested/src/extract.rs:845-854 | datafusion/functions-nested/src/extract.rs:939-948 \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":"datafusion/functions-nested/src/extract.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43e31afc03872dc42d254022a4600ddfc9fa2f8effcbe8d49670db382d7b2ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): datafusion/functions/src/core/greatest.rs:67-80 | datafusion/functions/src/core/least.rs:67-93 \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":"datafusion/functions/src/core/greatest.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b568cfc3448ba336d3adeee92062602c86f328720059fadd8ee5070f3bf70aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): datafusion/sql/src/unparser/utils.rs:33-61 | datafusion/sql/src/unparser/utils.rs:87-108 \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":"datafusion/sql/src/unparser/utils.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31e6bb6e6d4b7e194656df72c49922d4de1b290b1523d317e449c686885f56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/functions-nested/src/concat.rs:548-558 | datafusion/functions-nested/src/concat.rs:560-570 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/concat.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a5421ad05b03beb7b2e83075aa6e9b39b252fc54a7099bd5714062060f64e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/functions/src/datetime/make_date.rs:166-189 | datafusion/functions/src/datetime/make_time.rs:174-194 \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":"datafusion/functions/src/datetime/make_date.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a548442cabc44cd30e00bd870bf97b45b9a84aacfd19a6eac5c79d1316bbecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/functions/src/encoding/inner.rs:109-119 | datafusion/functions/src/encoding/inner.rs:182-192 \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":"datafusion/functions/src/encoding/inner.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ef2c57d99a5298dc0da9cadefa929499cc731b6dbb6b0fd7c882ed0891b185"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): datafusion/catalog/src/information_schema.rs:1129-1147 | datafusion/catalog/src/information_schema.rs:1170-1186 | datafusion/catalog/src/information_schema.rs:1209-1225 \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":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a388c94bbc8ad636cc94cf204a08a89c8164f3ef065c28cd8466144d0619039"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/datasource-csv/src/file_format.rs:901-921 | datafusion/datasource-json/src/file_format.rs:533-554 \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":"datafusion/datasource-csv/src/file_format.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e8406dcb9c8ee542f077c41e8352644e7cb0f804cc44bedbe2245584d0669a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/expr-common/src/interval_arithmetic.rs:767-777 | datafusion/expr-common/src/interval_arithmetic.rs:784-794 \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":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef6783775115f0aec62925ba6618ca15faad00bac98477acf52cdbe278d34ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/expr/src/logical_plan/information_schema.rs:674-690 | datafusion/expr/src/logical_plan/information_schema.rs:788-802 \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":"datafusion/expr/src/logical_plan/information_schema.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"e892c849a58690ce5fcfd05679147f2a2a2ddc3b0f59eac470ae8503fad60f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/functions-aggregate-common/src/min_max.rs:45-53 | datafusion/functions-aggregate-common/src/min_max.rs:59-67 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/min_max.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e492b72b7af74d098c1787a68352f2d5e231e305fd71f6df9cff18edee1e3342"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): datafusion/functions/src/math/log.rs:124-137 | datafusion/functions/src/math/log.rs:142-155 | datafusion/functions/src/math/log.rs:160-173 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/functions/src/math/log.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa9f15b6ace93e5cfba9309eb5900bde91aa6b4bf19a7bd2db9f3bf6a46ec4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): datafusion/physical-plan/src/buffer.rs:334-358 | datafusion/physical-plan/src/joins/cross_join.rs:464-495 | datafusion/physical-plan/src/limit.rs:582-608 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/buffer.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7a3345ecf8819b063a436cf2e71e355953e7d0069bf1b89462ef839fea771d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): datafusion/proto/src/logical_plan/file_formats.rs:77-93 | datafusion/proto/src/logical_plan/file_formats.rs:155-172 | datafusion/proto/src/logical_plan/file_formats.rs:243-263 \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":"datafusion/proto/src/logical_plan/file_formats.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56c2999b46932fd5c9d91e7d73eafe99735f42e9e77fdd2f841392a8562997e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/pruning/src/string_in_list.rs:19-29 | datafusion/pruning/src/string_in_list.rs:31-41 \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":"datafusion/pruning/src/string_in_list.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"038239b0bbf1039b20d9c201eb33f3ce593e5c0dd99d3f05045ec4e2d5e5c7f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/bool_op.rs:116-124 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs:171-183 \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":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/bool_op.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b696ddc8b330085900958b719b0cc7389114312e81c6a8ebd001f7659c1cd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/prim_op.rs:115-123 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/primitive.rs:272-287 \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":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/prim_op.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3bf5cb404e1d7a4363ec336b77d272fea7d17fe7af59b9ec18f3974a9b605c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): datafusion/physical-expr/src/expressions/in_list/primitive_filter.rs:301-319 | datafusion/physical-expr/src/expressions/in_list/primitive_filter.rs:421-439 \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":"datafusion/physical-expr/src/expressions/in_list/primitive_filter.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"956806e8ca086142f08dba7ae45021c175fa12642b1af341c6cbe477600c8d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/physical-plan/src/joins/hash_join/exec.rs:1570-1592 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:414-434 \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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ff0e3d2988b248aa2544d4a2dafd6ea7065e7b2a9ee57c6169ca6a3948aa06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): datafusion/functions/src/utils.rs:298-311 | datafusion/functions/src/utils.rs:313-326 | datafusion/functions/src/utils.rs:328-341 \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":"datafusion/functions/src/utils.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"915e2d50a0f703ed4a774e2df69166b0002966713648106d2309a442cbb2b50b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/physical-plan/src/joins/stream_join_utils.rs:587-599 | datafusion/physical-plan/src/joins/stream_join_utils.rs:622-634 \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":"datafusion/physical-plan/src/joins/stream_join_utils.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f527f90ae779abaf7a407b74d408a0959c7c004411b5dd1d697f6fde687c8ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/physical-plan/src/joins/utils.rs:1302-1317 | datafusion/physical-plan/src/joins/utils.rs:1320-1332 \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":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dcde999e980dcb91db77d73c3bb52963ff936eb87cb4d4cf64f3878cb1fb4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/datasource/src/memory.rs:773-787 | datafusion/proto/src/physical_plan/to_proto.rs:392-404 \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":"datafusion/datasource/src/memory.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11c9d1ebd73143eb379a79f4df0172b9654e6637208f2b212c2511c0ff913b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/expr/src/expr_fn.rs:911-925 | datafusion/expr/src/expr_fn.rs:951-965 \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":"datafusion/expr/src/expr_fn.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2a69e33dafa10664ebe6a07ccd58fc576f2fb8155f1bed263056e9903724b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/functions-aggregate-common/src/aggregate/count_distinct/bytes.rs:65-82 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/bytes.rs:128-145 \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":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/bytes.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4da133d07cef96461aa7ff1f1e1bea8b12439b23708fcea341690e5f7ddd20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:71-88 | datafusion/functions-aggregate-common/src/utils.rs:211-231 \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":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"011dca5f5f88e4ee58f52608c28fbeb49caf45acce219f738dec45e1351ea660"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/functions-nested/src/set_ops.rs:118-125 | datafusion/functions-nested/src/set_ops.rs:201-208 \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":"datafusion/functions-nested/src/set_ops.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7653ec4916d93231c3c968cd3ea9694b80688649c8554b9107bfac12de00ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): datafusion/physical-plan/src/buffer.rs:371-385 | datafusion/physical-plan/src/coalesce_partitions.rs:435-458 | datafusion/physical-plan/src/joins/cross_join.rs:503-521 \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":"datafusion/physical-plan/src/buffer.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf5ae53d5eb7f61d30a232263b620efe07b26afeb4e6a715f98723ee45ba7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): datafusion/catalog/src/information_schema.rs:541-560 | datafusion/catalog/src/information_schema.rs:577-601 \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":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"9112809711a317fde99ee62ba1675eb6048fd3c3f19d80e09133939d42a25e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): datafusion/ffi/src/catalog_provider.rs:239-258 | datafusion/ffi/src/catalog_provider_list.rs:202-220 | datafusion/ffi/src/udtf.rs:208-227 \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":"datafusion/ffi/src/catalog_provider.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"558f3c8c199f11c075fcb8aa7d89b8eb9f53e6129751772ab281bf2a7ce7abf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/ffi/src/physical_optimizer.rs:162-170 | datafusion/ffi/src/physical_optimizer.rs:176-187 \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":"datafusion/ffi/src/physical_optimizer.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f259a9d2ab63b519907b26e4a304a224a5390c0cc32e03246e7fc495e0dff155"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/functions-aggregate/src/first_last.rs:1399-1417 | datafusion/functions-aggregate/src/first_last.rs:1789-1803 \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":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b512b7f44690f1f7e75cf06fc09683113dabb4dfb79be2b311c47813be51339"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/pruning/src/pruning_predicate.rs:2169-2185 | datafusion/pruning/src/pruning_predicate.rs:2189-2205 \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":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9128008e4a4f22423d7721536f169aba858255583bf22cd08fa9002c9e662fbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): datafusion/functions-nested/src/cosine_distance.rs:137-146 | datafusion/functions-nested/src/distance.rs:135-144 | datafusion/functions-nested/src/inner_product.rs:143-152 \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":"datafusion/functions-nested/src/cosine_distance.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae43a39a0303e985ec389ba46eab0005b760dc2e423edbd20e1b95a45c9bfc3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs:53-67 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/primitive.rs:158-175 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"87321926c87d5c6bdd754654217deb2b28ff00c183d02a752f41fadb90f91558"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): datafusion/ffi/src/physical_optimizer.rs:209-227 | datafusion/ffi/src/table_provider_factory.rs:218-237 \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":"datafusion/ffi/src/physical_optimizer.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"536fa25ad4537b5f9b5996c06d333eb46a44cd47a5923643d7ad626068cc925e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): datafusion/ffi/src/schema_provider.rs:115-132 | datafusion/ffi/src/schema_provider.rs:138-153 | datafusion/ffi/src/schema_provider.rs:158-171 \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":"datafusion/ffi/src/schema_provider.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf248812dfef7445a7b98f1ea6b81d0e761ae7464a4ceee90c4519fc8aac64d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/optimizer/src/push_down_limit/topk_through_join.rs:329-341 | datafusion/optimizer/src/push_down_limit/topk_through_join.rs:358-371 \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":"datafusion/optimizer/src/push_down_limit/topk_through_join.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96d96b323eb974867731c9c6e2dc926ed15d6c22e2f35fca75b5ed356b39587"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): datafusion/physical-expr/src/expressions/dynamic_filters/mod.rs:546-567 | datafusion/physical-expr/src/expressions/dynamic_filters/mod.rs:569-589 \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":"datafusion/physical-expr/src/expressions/dynamic_filters/mod.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a311e7232d278e2c3f350d2ce0983de60965ee80efb530436831b619aeea8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/common/src/hash_utils.rs:725-738 | datafusion/common/src/hash_utils.rs:746-754 \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":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02e658e4e4e755b1569d0c76ee42abf8c344cb083c4b027195aacf36f920f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/common/src/tree_node.rs:186-196 | datafusion/expr/src/logical_plan/tree_node.rs:882-899 \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":"datafusion/common/src/tree_node.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b009ef423b46ad5973128bad9b336978313cff5c435bb47a18a2d000f6d56e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/common/src/tree_node.rs:221-231 | datafusion/common/src/tree_node.rs:245-256 \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":"datafusion/common/src/tree_node.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4611348de8644d0a4a3d558ea1677f784b1033374078a1c9f082112b448aa743"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): datafusion/datasource/src/mod.rs:173-191 | datafusion/datasource/src/mod.rs:209-228 \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":"datafusion/datasource/src/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41935246f03ab5d1471ca0d1a5b074016247fcc6b4dba62c3585609b0887996"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): datafusion/physical-expr/src/expressions/in_list.rs:487-508 | datafusion/physical-expr/src/expressions/lambda.rs:291-315 | datafusion/physical-expr/src/expressions/like.rs:140-161 \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":"datafusion/physical-expr/src/expressions/in_list.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fb012a86581f136dd1dabf553224229a6295bc9387253c60fc839fff382926"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/core/src/execution/context/mod.rs:1096-1108 | datafusion/core/src/execution/context/mod.rs:1110-1122 \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":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b600547a529ce900eb739c4f534f63d81a47296e991d131fb55bd23568c768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): datafusion/datasource-avro/src/source.rs:175-199 | datafusion/datasource-json/src/source.rs:275-307 \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":"datafusion/datasource-avro/src/source.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"157f2ae189a583d0193e33407d1a836e62575738f7f2f2d17ddeaef4a743b156"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/optimizer/src/push_down_filter.rs:181-198 | datafusion/physical-plan/src/joins/hash_join/exec.rs:2809-2824 \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":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"615b8958551fe2b170b5d0de046e02051d5b39f90714a504df37cf43aed0aad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/physical-plan/src/union.rs:596-611 | datafusion/physical-plan/src/union.rs:929-944 \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":"datafusion/physical-plan/src/union.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83e6ea7ccac7854125f8753ff3390c242a2a8d89bab51ea63512481ec857336"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/expr/src/logical_plan/information_schema.rs:79-90 | datafusion/expr/src/logical_plan/information_schema.rs:149-160 \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":"datafusion/expr/src/logical_plan/information_schema.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba894f8885a0bf713cb33585fd26f347eadd01ec615204d03eb75a71574564ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): datafusion/functions/src/unicode/mod.rs:37-37 | datafusion/functions/src/unicode/mod.rs:38-38 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/unicode/mod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a3c4a3068cb14edf0e9ebd7d0f4becdccac84318a7030338fc7b61fc822813"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): datafusion/physical-plan/src/joins/cross_join.rs:138-168 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:256-278 \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":"datafusion/physical-plan/src/joins/cross_join.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0869543ca8f352d69bc298deab1bf2939436b57559607b4e2be46061f2977c43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/physical-plan/src/projection.rs:1141-1152 | datafusion/physical-plan/src/projection.rs:1159-1170 \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":"datafusion/physical-plan/src/projection.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"212f7497f597980c40b8bbc18d6ad6523a56b26583c5a1e191dea31b45929453"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/sql/src/unparser/utils.rs:241-254 | datafusion/sql/src/utils.rs:288-300 \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":"datafusion/sql/src/unparser/utils.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30b0dbbd5541f120c03ca3199ad1352c9b36151b9c677f41dccf41ffb57b432"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): datafusion/functions/src/encoding/mod.rs:11-11 | datafusion/functions/src/encoding/mod.rs:12-12 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/encoding/mod.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8279f4bd70599d9a1dae069326d31a3ff17b2e24015013f2594495b964bad08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/physical-plan/src/aggregates/aggregate_stream.rs:214-226 | datafusion/physical-plan/src/aggregates/aggregate_stream.rs:237-249 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/aggregate_stream.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7027683c44d7177566e52d23d50e9c1f0dc40f81f83b5abb07e77972543226b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): datafusion/expr/src/logical_plan/ddl.rs:784-794 | datafusion/expr/src/logical_plan/dml.rs:63-76 | datafusion/expr/src/logical_plan/dml.rs:214-224 | datafusion/expr/src/logical_plan/plan.rs:4484-4496 \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":"datafusion/expr/src/logical_plan/ddl.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d0fdbf83a5eb6c30f1d39035cc2f57d878b003ad0c5590b07354f65cb2af16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/functions/src/string/split_part.rs:415-426 | datafusion/functions/src/unicode/substrindex.rs:553-567 \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":"datafusion/functions/src/string/split_part.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"6623754280ee957fc5e50b9e5c04753656f915e04d346d6dc35b32f98c37e8ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): datafusion/proto-common/src/from_proto/mod.rs:55-73 | datafusion/proto-common/src/to_proto/mod.rs:52-71 \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":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a148114bcbe2ea6e26b1efee70debc6855ad353993f1b52ff9bd37799b2c1fb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/substrait/src/logical_plan/consumer/rel/filter_rel.rs:16-30 | datafusion/substrait/src/logical_plan/consumer/rel/sort_rel.rs:16-25 \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":"datafusion/substrait/src/logical_plan/consumer/rel/filter_rel.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5584623df7d0c20655cac263b784b55afa3f41fae6a00cabbe0e0d4ea52a40c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): datafusion/common/src/types/canonical_extensions/bool8.rs:55-68 | datafusion/common/src/types/canonical_extensions/uuid.rs:55-68 \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":"datafusion/common/src/types/canonical_extensions/bool8.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"83707c8b44e40892ac7a267d621156c4afefc056623e9810520efa424eeae93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/functions-aggregate/src/approx_distinct.rs:327-342 | datafusion/functions-aggregate/src/approx_distinct.rs:380-396 \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":"datafusion/functions-aggregate/src/approx_distinct.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"568f1953cce67dc09140a90d6f230f906023eae5a07d515472bc9717e24cdd41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 1\u002B corresponding lines): datafusion/functions/src/crypto/mod.rs:16-16 | datafusion/functions/src/crypto/mod.rs:17-17 | datafusion/functions/src/crypto/mod.rs:18-18 | datafusion/functions/src/crypto/mod.rs:19-19 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/crypto/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3533a2f098b18cd4505ddca9441e56c1e61e6cc2d981c4787687e858a75c449"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/functions/src/strings.rs:84-98 | datafusion/functions/src/strings.rs:291-305 \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":"datafusion/functions/src/strings.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2365dbc83c7c035d2689339f0819d2b2d6f11b1d0b5eb87b90872eb3265772"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): datafusion/physical-expr/src/expressions/is_not_null.rs:118-132 | datafusion/physical-expr/src/expressions/is_null.rs:117-131 | datafusion/physical-expr/src/expressions/negative.rs:217-231 | datafusion/physical-expr/src/expressions/not.rs:197-210 \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":"datafusion/physical-expr/src/expressions/is_not_null.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"078e54e9528655457d3903c3af46db90280486eb357c8654bcc4ae2f433b927c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/physical-plan/src/filter.rs:276-290 | datafusion/physical-plan/src/filter.rs:971-982 \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":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e822969e4b7bd9c76fd693c4f4aedf8b323f252d85fcfc2a74d4b1386f6506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/physical-plan/src/operator_statistics/mod.rs:509-532 | datafusion/physical-plan/src/operator_statistics/mod.rs:548-564 \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":"datafusion/physical-plan/src/operator_statistics/mod.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c8182a98d2cc9fa67d0bfa2cfae66521e6ebe4b61d477dc8d49702e95d32a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/substrait/src/logical_plan/producer/expr/field_reference.rs:33-47 | datafusion/substrait/src/logical_plan/producer/expr/lambda_variable.rs:21-36 \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":"datafusion/substrait/src/logical_plan/producer/expr/field_reference.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"880301d1cbee2cda91577b67b2bb5bb0f0353ff2b754dedfffd7dcf465beca4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/datasource-parquet/src/file_format.rs:557-569 | datafusion/datasource-parquet/src/file_format.rs:577-590 \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":"datafusion/datasource-parquet/src/file_format.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8503742a59b5e772a4f2e9e5ed5d266fa16202d9ebeab9a36870eb81568a8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/functions-aggregate/src/approx_percentile_cont.rs:45-62 | datafusion/functions-aggregate/src/approx_percentile_cont_with_weight.rs:39-56 \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":"datafusion/functions-aggregate/src/approx_percentile_cont.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0258224d6d805c187420827b0ed2ef7bfeb76734344566a4713e0de5415b6b71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/functions-aggregate/src/average.rs:548-558 | datafusion/functions-aggregate/src/average.rs:595-605 \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":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c063a4a454de22c6f0a21c5bcc9a660e4f52c1be0dee4922d7da7f3f58ac058"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/functions/src/core/overlay.rs:90-100 | datafusion/functions/src/string/levenshtein.rs:92-104 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/core/overlay.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1631f4d6d2c07ccc77e82093e2d3cea7bd42f307908a8a992741f1d307d6d061"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/functions/src/string/split_part.rs:394-405 | datafusion/functions/src/unicode/substrindex.rs:531-545 \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":"datafusion/functions/src/string/split_part.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ceba928aec7ad6ea36897f405cabecc409849a73cda0a7171fc38eded6d067d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): datafusion/physical-plan/src/aggregates/aggregate_hash_table/mod.rs:24-48 | datafusion/physical-plan/src/aggregates/aggregate_stream.rs:543-556 \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":"datafusion/physical-plan/src/aggregates/aggregate_hash_table/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c57147597bdce7a5ff315f1634847ec34ca18533e0019a5cdc30a2391326e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/proto/src/physical_plan/from_proto.rs:521-537 | datafusion/proto/src/physical_plan/mod.rs:2008-2024 \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":"datafusion/proto/src/physical_plan/from_proto.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cad1e621ebcd5eef73b2f91736ee6535510ef9b34ff64eea8051005847a1385"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/physical-plan/src/operator_statistics/mod.rs:369-378 | datafusion/physical-plan/src/operator_statistics/mod.rs:626-637 \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":"datafusion/physical-plan/src/operator_statistics/mod.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff509ad5a9239b424ff5b7235d55720410feed0bac3266259a3e9b86b3ab069"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/common/src/scalar/mod.rs:1633-1640 | datafusion/common/src/scalar/mod.rs:1701-1708 \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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"738476227a1c455954fceec8282e13b1a59e55d93d5fbd8a6fa0e1b18c6a6be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/common/src/scalar/mod.rs:1711-1718 | datafusion/common/src/scalar/mod.rs:1721-1728 \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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"a701dcc9d594493a3517ff62dbf526db965d721663c2f1ac350d2c4d3c35ed19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/core/src/execution/context/mod.rs:1081-1094 | datafusion/core/src/execution/context/mod.rs:1502-1514 \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":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab2ef6ece6903968ca3002b01289389d000b7ac9489577951096dc9e3625ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): datafusion/functions-aggregate/src/lib.rs:182-194 | datafusion/functions-window/src/lib.rs:74-86 | datafusion/functions/src/lib.rs:167-178 \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":"datafusion/functions-aggregate/src/lib.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca73712a218aa8a44bf192b25fd13a18dfb93180cd8c2e050986bdb4bcf00e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/optimizer/src/push_down_filter.rs:1637-1648 | datafusion/optimizer/src/push_down_filter.rs:1659-1670 \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":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfd1cfd3330aecd6e1f51875616c178c8826838553cc1ba92de8e38c00b2f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/physical-expr/src/physical_expr.rs:30-41 | datafusion/physical-expr/src/utils/mod.rs:298-311 \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":"datafusion/physical-expr/src/physical_expr.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43a86a10c5e4be1a5f26e0816e8fe1183aca6400689620130fc2560f5e1c3d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/expr-common/src/statistics.rs:362-387 | datafusion/expr-common/src/statistics.rs:445-462 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a960c4cf3cc20f092e1c8c1c0225f0a75aeab443ed141ac446297965dc0659"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/ffi/src/udaf/mod.rs:484-496 | datafusion/ffi/src/udf/mod.rs:417-429 \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":"datafusion/ffi/src/udaf/mod.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"988a790519412534231454a93bbd2bae0399196b4900b132e8474992d14bdc91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/functions-aggregate/src/approx_percentile_cont.rs:293-310 | datafusion/functions-aggregate/src/approx_percentile_cont_with_weight.rs:178-200 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/approx_percentile_cont.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4342976e20612553db209fe53dbd33414da30ded812e1250386b38fcc05ec2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/functions/src/crypto/md5.rs:53-67 | datafusion/functions/src/crypto/sha.rs:108-124 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/crypto/md5.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbaa63e10b0d82232d6241d20c4a785b6016e56a0ec47816dddfc1a6a2647e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/physical-expr/src/expressions/is_not_null.rs:64-75 | datafusion/physical-expr/src/expressions/is_null.rs:64-74 \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":"datafusion/physical-expr/src/expressions/is_not_null.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6e1c0f6b0cc4ecc2ac8c1190d5c9cbaf4ed0fa5bb4390a79ccbc3b2a9cc981"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/common/src/dfschema.rs:155-169 | datafusion/common/src/dfschema.rs:175-186 \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":"datafusion/common/src/dfschema.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7042fbf4692eec6050d7a9e00940804943f165951521fb0f0610c98dc65ae6d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/common/src/utils/mod.rs:1219-1232 | datafusion/physical-plan/src/joins/hash_join/shared_bounds.rs:229-239 \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":"datafusion/common/src/utils/mod.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"03547d5cb79fb563449cbdd9130f02c5a40cd1b87480a9d253a3a8e8e7dd8aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): datafusion/ffi/src/udaf/accumulator.rs:254-265 | datafusion/ffi/src/udaf/accumulator.rs:303-314 | datafusion/ffi/src/udaf/accumulator.rs:316-327 | datafusion/ffi/src/udaf/groups_accumulator.rs:359-374 \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":"datafusion/ffi/src/udaf/accumulator.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f866f864a668b37654cd956e5a5b080ace5afe96d9b40f9b3dce2291e75d9fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/functions-aggregate/src/count.rs:563-572 | datafusion/functions-aggregate/src/sum.rs:683-696 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/count.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4591f10dd3af5aae8d506121f840df14914e030c4b146b7ace611304a9c9dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/functions/src/string/bit_length.rs:74-81 | datafusion/functions/src/string/octet_length.rs:89-96 \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":"datafusion/functions/src/string/bit_length.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e733bebf960ed1e77b764b785306b214f00002cce9063decf63525a0ba44f926"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/physical-expr/src/expressions/case.rs:1069-1079 | datafusion/physical-expr/src/expressions/case.rs:1092-1102 \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":"datafusion/physical-expr/src/expressions/case.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abfce1d24ead8166548175e9a1949e0c7c6dee8492cce6270e32d3a19aa052b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/physical-plan/src/sorts/cursor.rs:639-650 | datafusion/physical-plan/src/sorts/cursor.rs:653-665 \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":"datafusion/physical-plan/src/sorts/cursor.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d7e9ff48f7ed459e5372250597d44f610eabf934fb73e7b5834a965a920e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): datafusion/catalog/src/information_schema.rs:992-1003 | datafusion/catalog/src/information_schema.rs:1026-1037 | datafusion/catalog/src/information_schema.rs:1060-1072 | datafusion/catalog/src/information_schema.rs:1095-1106 \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":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"29666596e6959ff81f19846052cae752f86d1dc5d0519885ac5fad08695cfaf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): datafusion/ffi/src/proto/logical_extension_codec.rs:436-443 | datafusion/ffi/src/proto/logical_extension_codec.rs:454-461 | datafusion/ffi/src/proto/logical_extension_codec.rs:473-480 | datafusion/ffi/src/proto/physical_extension_codec.rs:377-384 | datafusion/ffi/src/proto/physical_extension_codec.rs:395-402 | datafusion/ffi/src/proto/physical_extension_codec.rs:414-421 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"da169704bd59ff6ab1e921f9b8b824bb07d672cfab584b42fb4f9404398225ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/functions-aggregate/src/first_last.rs:1526-1532 | datafusion/functions-aggregate/src/first_last.rs:1912-1918 \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":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9effa1a9b44725e8bf429a0535504be23108b9ebf4dc6e2a96410d62af45f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:2331-2343 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:2348-2358 \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":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f7bf232164a0d7c06cafa4f54748e3b78d7ed3cb421caaadc71cc7dc62091f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/physical-plan/src/projection.rs:134-140 | datafusion/physical-plan/src/projection.rs:161-170 \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":"datafusion/physical-plan/src/projection.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32f2f76361e1434121b832ac60f27671fe6d1f1de8c3d694151b8e86000eda7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:432-440 | datafusion/physical-plan/src/windows/window_agg_exec.rs:224-236 \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":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0d1ebc6d97722cedef151ab6bc2d38a7c0bb6ac0b08d33386b9a6246b366f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): datafusion/expr-common/src/interval_arithmetic.rs:1886-1894 | datafusion/expr-common/src/interval_arithmetic.rs:1904-1912 | datafusion/expr-common/src/interval_arithmetic.rs:1922-1930 \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":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b535cef90dcbb37b18677dda298591326cb5c122608679537c217ea0ca50a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/expr/src/type_coercion/functions.rs:371-380 | datafusion/optimizer/src/analyzer/type_coercion.rs:1463-1475 \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":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"255e59ff9615153efe8cdd88af1775890a2a52ec862d4089ba5cc35e4de00b73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/functions-aggregate/src/average.rs:653-663 | datafusion/functions-aggregate/src/average.rs:840-850 \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":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c130c15716a001d0e4dd33d10bb16a9733b40c7a32014850658ef5a9116572f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/pruning/src/pruning_predicate.rs:2111-2126 | datafusion/pruning/src/pruning_predicate.rs:2130-2145 \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":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a693aa9a225ee587316298ff00265bf83370846901f2bfa6673dba0930daf633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/core/src/execution/context/mod.rs:975-988 | datafusion/datasource/src/file_format.rs:42-53 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"289596fa81d57ab7c6e1e98df0fb5a02e4e59f4eb5d9dc1e81e15afd6b9fa89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): datafusion/ffi/src/catalog_provider.rs:125-144 | datafusion/ffi/src/catalog_provider.rs:150-170 | datafusion/ffi/src/catalog_provider_list.rs:98-115 \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":"datafusion/ffi/src/catalog_provider.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d368183c10d95135808250531eba73ddd08c86307a6d524e0916466efc1f19d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): datafusion/functions-aggregate/src/average.rs:615-623 | datafusion/functions-aggregate/src/average.rs:798-807 | datafusion/functions-aggregate/src/average.rs:851-859 \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":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b0245142980bebdf1df8dfa2fad9f19240023a4dc4bebb633478dc89a7393c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/functions-aggregate/src/bit_and_or_xor.rs:449-455 | datafusion/functions-aggregate/src/bit_and_or_xor.rs:457-465 \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":"datafusion/functions-aggregate/src/bit_and_or_xor.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edebc6951b0515e9a4a2713528efafa160b0ed13c26bc14ebdaa0847134e7cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): datafusion/functions-nested/src/extract.rs:825-838 | datafusion/functions-nested/src/extract.rs:915-932 | datafusion/functions-nested/src/extract.rs:1013-1027 \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":"datafusion/functions-nested/src/extract.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"7add3772dfeec0e21a0127ac37a6182544092262aa9e2c37e2c5d6567a5180d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): datafusion/functions/src/math/monotonicity.rs:14-26 | datafusion/functions/src/math/monotonicity.rs:93-105 | datafusion/functions/src/math/monotonicity.rs:190-202 \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":"datafusion/functions/src/math/monotonicity.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b297f05863b9db568ffa5c1384affca94a3834a281ae37ed0cc11d24d36db2ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:111-125 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes_view.rs:121-134 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/fixed_size_binary.rs:136-151 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/list.rs:148-160 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/row_backed.rs:247-263 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d90b3898b5e47c6709750645c126339278d7fd08460b975c3faceda97403ce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/physical-plan/src/joins/hash_join/stream.rs:763-782 | datafusion/physical-plan/src/joins/piecewise_merge_join/existence_join.rs:194-209 \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":"datafusion/physical-plan/src/joins/hash_join/stream.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"217f886c75f9630284ba934beb005186d8337f5b286f5d287e592b5b2f7a4699"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/physical-plan/src/limit.rs:231-255 | datafusion/physical-plan/src/limit.rs:520-535 \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":"datafusion/physical-plan/src/limit.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97587edf2f3d5723ff854662c0ad3c4e12e56272f39432e67236851414e6631"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): datafusion/expr-common/src/statistics.rs:318-331 | datafusion/expr-common/src/statistics.rs:340-350 | datafusion/expr-common/src/statistics.rs:530-536 \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":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a3b3ed04f5371d92ce9fcc4f8727bef472a36744092755559577f3e5ac0b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/functions-aggregate-common/src/utils.rs:197-208 | datafusion/functions-aggregate/src/percentile_cont.rs:930-943 \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":"datafusion/functions-aggregate-common/src/utils.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc063a94624167b3487e023856ebebe8ed2ad646decd91a7b4c581b1ba32d70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/functions-aggregate/src/average.rs:664-671 | datafusion/functions-aggregate/src/sum.rs:537-544 \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":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bca74e8775426277591b1d45678b65bc98b8e23d70e448d11b295bd190abc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/functions-nested/src/map_extract.rs:93-105 | datafusion/functions-nested/src/map_keys.rs:76-84 \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":"datafusion/functions-nested/src/map_extract.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1c4b3bb406aaf64f181d90bf5daf9b0beda8e5b165ff45300033aed8666f4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:86-95 | datafusion/physical-plan/src/aggregates/hash_stream.rs:534-543 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/clustered_final_stream.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baa0f08cec0c953406c7206f2a33d0dcc1043e5bb4db2b4df2908870ce1381c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:640-644 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:454-458 \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":"datafusion/physical-plan/src/joins/sort_merge_join/exec.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c72ff6471711d9bb97c49766527500ca34aa720593f58e2ddc5ffc44907d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/common/src/config.rs:144-2262 | datafusion/common/src/config.rs:3492-3812 \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":"datafusion/common/src/config.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d120301e42cfff84af3f95270f1dad009802eae5193c0f614330fd0eefab13ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): datafusion/datasource-avro/src/source.rs:134-141 | datafusion/datasource-csv/src/source.rs:639-646 | datafusion/datasource-json/src/source.rs:239-246 \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":"datafusion/datasource-avro/src/source.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a5d057c29ab29f2ac744fcd4b48f1d545c5511d4d537f5f9cbd8bdc62372f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): datafusion/expr-common/src/casts.rs:631-649 | datafusion/expr/src/type_coercion/mod.rs:31-46 \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":"datafusion/expr-common/src/casts.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"739591a4d1b672a80ab995a1a6b9f2e619806faa54f174eca33847de4f058deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/functions/src/unicode/left.rs:77-89 | datafusion/functions/src/unicode/right.rs:77-89 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/unicode/left.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"33533e434bbad9843ef1dbd17ebb2806ab639a0c40a92ae2c6b66c9a0ff8c9d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): datafusion/physical-expr/src/equivalence/class.rs:989-999 | datafusion/physical-expr/src/equivalence/grouping.rs:168-178 | datafusion/physical-expr/src/equivalence/ordering.rs:286-296 | datafusion/physical-expr/src/equivalence/properties/dependency.rs:25-35 \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":"datafusion/physical-expr/src/equivalence/class.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d488a64cd79bbba7231a55bbc58a0b10227347a85bec793b46cf2357ae00b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/physical-plan/src/aggregates/topk/heap.rs:167-174 | datafusion/physical-plan/src/aggregates/topk/heap.rs:253-263 \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":"datafusion/physical-plan/src/aggregates/topk/heap.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8433225d46f4668bdcd1cb84ea405743816949dbd3d195c15f4de9fa9c8542b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/physical-plan/src/coop.rs:271-282 | datafusion/physical-plan/src/union.rs:777-791 \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":"datafusion/physical-plan/src/coop.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b4cf98d187943f3b0a9e75ef81b1dd6a729d33058421ad92b6c45d4924c27c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/sql/src/expr/mod.rs:317-329 | datafusion/sql/src/expr/mod.rs:885-895 \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":"datafusion/sql/src/expr/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be16a9ea8acb6d899a15f5d505c3440dd214d515afc3d433668a9a6d1ec2041"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/expr-common/src/type_coercion/binary.rs:1922-1935 | datafusion/expr-common/src/type_coercion/binary.rs:2070-2078 \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":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"deceef6a92c3da01e8013b3a34f7a25488e74f6d3df88effefa567c963a3cdcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/ffi/src/physical_expr/mod.rs:598-607 | datafusion/ffi/src/physical_expr/mod.rs:637-648 \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":"datafusion/ffi/src/physical_expr/mod.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8d8afd7491944cdb65e9fdc5fdab7fb0e8762571c23713e2f0a13813feec89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/functions-aggregate-common/src/aggregate/count_distinct/groups.rs:101-108 | datafusion/functions-aggregate/src/count.rs:734-741 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/groups.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dc7a42a0bef8ce20000ad53b7b5bf295fd5988f6203b03835d8fa4995b2f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/prim_op.rs:107-113 | datafusion/functions-aggregate/src/first_last/state.rs:97-104 \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":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/prim_op.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9015ceac0b1c9a685aa8d6869e28fd8a5e9d911a0acee38a8f93c500fe2cd96f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/functions-aggregate/src/min_max.rs:693-702 | datafusion/functions-aggregate/src/min_max.rs:821-830 \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":"datafusion/functions-aggregate/src/min_max.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a849372151251a03f10bc1835d8715478f6d45fbe0405fabc214144af8ca56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/functions-aggregate/src/variance.rs:356-364 | datafusion/functions-aggregate/src/variance.rs:366-374 \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":"datafusion/functions-aggregate/src/variance.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"666f125138cb4429cf28b1d8519eb9a3bdc95975d8cf711d58a32baa0601cc2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/physical-plan/src/joins/hash_join/exec.rs:1285-1292 | datafusion/physical-plan/src/joins/nested_loop_join.rs:449-458 \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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0e138f8a96e21b76f8c68709e6b34c96931eb69715622c363f34f5854e033f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): datafusion/common/src/scalar/mod.rs:3619-3631 | datafusion/common/src/scalar/mod.rs:3682-3694 | datafusion/common/src/scalar/mod.rs:3726-3734 \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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":3619}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b2a05afad187efff85ac42a3dbdcc19364ed9530a513b571358fb82595ad95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): datafusion/common/src/utils/memory.rs:202-215 | datafusion/common/src/utils/memory.rs:293-308 \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":"datafusion/common/src/utils/memory.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d815d07ea3b24863b5cbf19055f8ca1bd9ffa22102360c3dc963849e6f064a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/datasource-parquet/src/reader.rs:119-133 | datafusion/datasource-parquet/src/reader.rs:167-183 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/reader.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42d21a7148b4f95a7a6806da6b100a2be46ee7959971d2146b0e70210cd9cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/ffi/src/udwf/partition_evaluator.rs:281-293 | datafusion/ffi/src/udwf/partition_evaluator.rs:324-340 \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":"datafusion/ffi/src/udwf/partition_evaluator.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4f1e8268c28c530f3f170fd0e02e39133a68f4bdfacbd71180533ac3061679"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/physical-expr-common/src/binary_map.rs:691-699 | datafusion/physical-expr-common/src/binary_view_map.rs:590-599 \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":"datafusion/physical-expr-common/src/binary_map.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f069ea6dc39817199dfd2bf70c5b758cdeb7f6119c693e5354970d2e29481d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/physical-expr-common/src/metrics/expression.rs:44-58 | datafusion/physical-plan/src/aggregates/group_values/metrics.rs:121-133 \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":"datafusion/physical-expr-common/src/metrics/expression.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b3afd44f40570e2ede1120749dd26f6a75db4236d2e5e2ace46626bbf923a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): datafusion/physical-expr-common/src/physical_expr.rs:933-946 | datafusion/physical-plan/src/render_tree.rs:152-165 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/physical_expr.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5f63e59b70d0854e895ddf5c9acd9f0c7209c2c86f5937b5ecb5356e2309fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/physical-plan/src/empty.rs:142-162 | datafusion/physical-plan/src/placeholder_row.rs:158-174 \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":"datafusion/physical-plan/src/empty.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5f22f75ff489769e05ea45e17b96a3f9eeaf3ba1dfc8bbd9ba13d27d744727"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): datafusion/core/src/execution/session_state.rs:2368-2377 | datafusion/core/src/execution/session_state.rs:2382-2392 | datafusion/core/src/execution/session_state.rs:2397-2406 | datafusion/core/src/execution/session_state.rs:2411-2420 \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":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0c41186c457882453303d3bf715c8e7fea3b902d365ec1574d5be75e377acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): datafusion/datasource-arrow/src/file_format.rs:385-397 | datafusion/datasource-avro/src/file_format.rs:303-315 | datafusion/datasource-csv/src/file_format.rs:773-785 | datafusion/datasource-json/src/file_format.rs:410-422 | datafusion/datasource-parquet/src/sink.rs:86-98 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-arrow/src/file_format.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2ddd121d8cba124806310be2c10acc5d440949ee8e950f209e251d1eb1599e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/functions-aggregate/src/count.rs:869-879 | datafusion/functions-aggregate/src/count.rs:883-892 \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":"datafusion/functions-aggregate/src/count.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"9741a6db866c22145d58d65e89e01601d7fa31d4b18cab28214e8e9055f94623"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/functions-window/src/lead_lag.rs:60-67 | datafusion/functions-window/src/lead_lag.rs:79-86 \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":"datafusion/functions-window/src/lead_lag.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e66f416e256dbf2e9501b93562d6d48253dbe371490ae58518fc1d6c3c72b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/physical-expr/src/expressions/case/literal_lookup_table/bytes_like_lookup_table.rs:58-67 | datafusion/physical-expr/src/expressions/case/literal_lookup_table/primitive_lookup_table.rs:78-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":"datafusion/physical-expr/src/expressions/case/literal_lookup_table/bytes_like_lookup_table.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"63437ed70c80633ac30c80528605f7f927ddc3f25b896f453acba6ee652a0768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): datafusion/physical-plan/src/coop.rs:395-415 | datafusion/physical-plan/src/union.rs:568-588 | datafusion/physical-plan/src/union.rs:901-921 \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":"datafusion/physical-plan/src/coop.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1102bd674a4050974dbda4ca0a7c27876a244eb5d776d4e3b9a2ce0738a5adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:516-530 | datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:548-570 \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":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ff06b472f1430372a115416e76f6f6e9e53c7538f356e8d25c1c42dd6171e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): datafusion/pruning/src/key_range_bitmap_expr.rs:78-85 | datafusion/pruning/src/primitive_in_list.rs:353-362 | datafusion/pruning/src/string_in_list.rs:246-254 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/pruning/src/key_range_bitmap_expr.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"02efdc6658aa92666dec6fd4cefd1b146bc21f1330391bd902b9caef7f1ac27a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/catalog/src/memory/table.rs:553-565 | datafusion/catalog/src/memory/table.rs:759-771 \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":"datafusion/catalog/src/memory/table.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd72733e82a782d92561cf1dce69d6bf689a4db0ca227c3d81088259967bcf36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): datafusion/common/src/utils/mod.rs:713-720 | datafusion/common/src/utils/mod.rs:728-733 \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":"datafusion/common/src/utils/mod.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf10aed1e52b6adfb7a5868258a232e9930bc6da3e8301a42f99525ed7b071fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/datasource/src/memory.rs:791-803 | datafusion/proto/src/physical_plan/from_proto.rs:483-493 \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":"datafusion/datasource/src/memory.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dd70c0e4cf0b420738fd43ba3430b3a250066312e6b7979f5d5c9367068fef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/ffi/src/config/mod.rs:62-71 | datafusion/ffi/src/config/mod.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":"datafusion/ffi/src/config/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ff8c6b56ddff7658b46385428dacdddc635c0992fc3a520f19d1822c134c5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): datafusion/functions-nested/src/remove.rs:186-201 | datafusion/functions-nested/src/replace.rs:81-99 | datafusion/functions-nested/src/replace.rs:188-207 | datafusion/functions-nested/src/replace.rs:307-325 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/remove.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f6723b08283ee72c6c2f8137a37d622921b31d83a53a53dbdef46fe38785fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/physical-plan/src/aggregates/mod.rs:1232-1242 | datafusion/physical-plan/src/aggregates/mod.rs:1244-1252 \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":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f84ce22c7fd6676f57f232bcd691a05f8459dc48a0d2e717abb33b3bf00d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/sql/src/unparser/plan.rs:2503-2512 | datafusion/sql/src/unparser/plan.rs:2514-2526 \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":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":2503}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fd6266eae35c47aa6e6fd87b04cd9ccb4abb5614de07b59c024bd1181e27a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/functions-nested/src/min_max.rs:82-88 | datafusion/functions-nested/src/min_max.rs:164-170 \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":"datafusion/functions-nested/src/min_max.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"859f56aebc13406a100592baa0385ae020d7932a695954916e4cb60b16e1615b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/functions-nested/src/min_max.rs:103-110 | datafusion/functions-nested/src/min_max.rs:181-188 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/min_max.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"47eb24c176b13d078abe76a3854e6ca2a7f7ee8cec27e28d1f9ac3c20a8ac77c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/pruning/src/pruning_predicate.rs:1183-1195 | datafusion/pruning/src/pruning_predicate.rs:1203-1215 \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":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"db09fda4b159f686b5001fdefae576eec649f4b61f35340b0cc50ca404c6f281"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/sql/src/expr/mod.rs:336-343 | datafusion/sql/src/expr/mod.rs:351-358 \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":"datafusion/sql/src/expr/mod.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5139516e80b2fa6d271cd6f7ce6c021b5f68f4f5c89fd3715554d47f9eeb0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/common/src/types/canonical_extensions/bool8.rs:79-88 | datafusion/common/src/types/canonical_extensions/uuid.rs:79-90 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/types/canonical_extensions/bool8.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"de616c1eca45801c6ec029e79b3519621698ebc499cdf9bd530d4f2a8553561d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): datafusion/core/src/bin/print_functions_docs.rs:44-52 | datafusion/core/src/bin/print_functions_docs.rs:54-66 | datafusion/core/src/bin/print_functions_docs.rs:68-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 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":"datafusion/core/src/bin/print_functions_docs.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ed90ff4770fabb655676a8da6a37e57b96c2bd951c12e33041b8f14ea65cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/expr-common/src/signature.rs:1364-1373 | datafusion/expr/src/logical_plan/dml.rs:471-480 \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":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"259bab9188d110f5444a51ba0ed48b9d9835786b12f9dffdd6b6caa14bd2be12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/expr/src/udaf.rs:1503-1513 | datafusion/functions-aggregate/src/regr.rs:455-463 \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":"datafusion/expr/src/udaf.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"f288e0f030f95f2653fc7820adf209a8c65c88a168c51427daf2eede2b386834"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/expr/src/utils.rs:42-54 | datafusion/expr/src/utils.rs:242-257 \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":"datafusion/expr/src/utils.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"77461959d79e908d1885472ec4bdfff86c77313fc99c27494b8b8f7bc7401eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): datafusion/functions/src/datetime/date_bin.rs:262-277 | datafusion/functions/src/math/round.rs:440-453 | datafusion/functions/src/math/trunc.rs:251-264 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/functions/src/datetime/date_bin.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"32740c4f8a59ae043ae66dc0265abe498ec6b19f64ede4ff18b8736d7cb00314"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/functions/src/strings.rs:1495-1506 | datafusion/functions/src/strings.rs:1510-1518 \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":"datafusion/functions/src/strings.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f884ceb61bc2e7b22271f879079684986b6840e298f8789e3970f7d862e893"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): datafusion/functions/src/unicode/find_in_set.rs:54-66 | datafusion/functions/src/unicode/substrindex.rs:72-85 | datafusion/functions/src/unicode/translate.rs:56-68 \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":"datafusion/functions/src/unicode/find_in_set.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"38778d72a42f1990e43b76c221bb38407a6b898dc01164a31db7e87abaddcb78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/physical-plan/src/aggregates/order/partial.rs:126-142 | datafusion/physical-plan/src/aggregates/order/full.rs:69-83 \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":"datafusion/physical-plan/src/aggregates/order/partial.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6905d73fcb3e8ddfed45c19cb3268d5366635286672f27d57b75448bb58623b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/common/src/scalar/mod.rs:1486-1493 | datafusion/expr-common/src/casts.rs:554-561 \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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fe8c86b3ad5a6fe222aee41f23015f467417cfe2bd7a70695198dfd5492344"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): datafusion/common/src/scalar/mod.rs:5193-5197 | datafusion/functions-aggregate/src/count.rs:582-594 \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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":5193}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cc1082a972d3f78c37bbf8aa031743389e2f83b0980d57b071745bba3e751a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 7\u002B corresponding lines): datafusion/core/src/execution/session_state.rs:2323-2329 | datafusion/core/src/execution/session_state.rs:2334-2341 | datafusion/core/src/execution/session_state.rs:2346-2352 | datafusion/core/src/execution/session_state.rs:2357-2363 | datafusion/execution/src/task.rs:208-214 | datafusion/execution/src/task.rs:215-221 | datafusion/execution/src/task.rs:222-228 | datafusion/execution/src/task.rs:233-241 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":2323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a597453a9b8f900aa8a52d3a3ee882bbac391fd430ab6d23a9c3f6a47593bd05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): datafusion/ffi/src/execution/task_ctx.rs:111-124 | datafusion/ffi/src/execution/task_ctx.rs:128-138 | datafusion/ffi/src/session/mod.rs:275-287 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/ffi/src/execution/task_ctx.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad430d15f0244cdc70b327dcac3182692c9e9d074921f1b4a8e9d4f1b9d4624"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): datafusion/ffi/src/physical_expr/mod.rs:243-257 | datafusion/ffi/src/physical_expr/mod.rs:293-306 | datafusion/ffi/src/physical_expr/mod.rs:340-352 \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":"datafusion/ffi/src/physical_expr/mod.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5238541ac33bb448b894a995a555cff938d98bbdca8c3a274a6666bcabe12fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/ffi/src/physical_expr/mod.rs:530-536 | datafusion/ffi/src/physical_expr/mod.rs:553-559 \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":"datafusion/ffi/src/physical_expr/mod.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb141ea6207f076ad5680d67b051b65514798f7190241e474c7099798142cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/ffi/src/physical_optimizer.rs:303-311 | datafusion/ffi/src/physical_optimizer.rs:317-329 \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":"datafusion/ffi/src/physical_optimizer.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc26c91a17eea86603089c02e379130ba4960c34a474ff05d991eedf975ae21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/functions-aggregate/src/bool_and_or.rs:150-161 | datafusion/functions-aggregate/src/bool_and_or.rs:284-296 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/bool_and_or.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"193f6fd60ceb12ae602c878820ebdd1ac8042f2fe25b4dd55132fe7f05df1dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): datafusion/functions-nested/src/repeat.rs:83-98 | datafusion/functions/src/string/repeat.rs:61-76 | datafusion/functions/src/string/split_part.rs:59-74 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/functions-nested/src/repeat.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6483b390b7ec046da0e27c069e3e5a831fffb63d784c66cd1da0c104a8ee1ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs:158-169 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/primitive.rs:255-270 \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":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f72d8ff8dbf7f5b5ceffe7edbd64c31c4f7e9252c00119edac5f3d6da1240d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/common/src/dfschema.rs:195-205 | datafusion/common/src/dfschema.rs:1173-1183 \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":"datafusion/common/src/dfschema.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9a17b519cc7bcead24f55520b8ee693b64dcc9f5adfa1a1d2937113987ba48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/common/src/utils/mod.rs:1114-1124 | datafusion/common/src/utils/mod.rs:1131-1138 \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":"datafusion/common/src/utils/mod.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26a98304b5a26bfbb7dc5bd8d511ff7fe76e5a397b8e84286866d7f4d71a113"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/expr/src/expr_rewriter/mod.rs:188-201 | datafusion/expr/src/expr_rewriter/mod.rs:232-244 \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":"datafusion/expr/src/expr_rewriter/mod.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb1e82c097dae473f79e5986a67df60f25c4f221eaf7ed5177f84ccfbf77455"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/physical-expr-common/src/binary_map.rs:300-312 | datafusion/physical-expr-common/src/binary_view_map.rs:173-185 \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":"datafusion/physical-expr-common/src/binary_map.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcbfd563771ea7529a751e91ff16b72fe549eb5fd22c456e3bb98e36761fe69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): datafusion/ffi/src/proto/logical_extension_codec.rs:445-452 | datafusion/ffi/src/proto/logical_extension_codec.rs:463-471 | datafusion/ffi/src/proto/logical_extension_codec.rs:482-490 | datafusion/ffi/src/proto/physical_extension_codec.rs:386-393 | datafusion/ffi/src/proto/physical_extension_codec.rs:404-412 | datafusion/ffi/src/proto/physical_extension_codec.rs:423-431 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"1435d7e9c84e9f7db41ecfadd000ab2b6c67db4aec1f00a6c5d5d3aea0765997"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): datafusion/functions/src/core/cast_to_type.rs:92-102 | datafusion/functions/src/core/try_cast_to_type.rs:84-89 \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":"datafusion/functions/src/core/cast_to_type.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7c3cb3f13963c03a41b256b75a0a3b72ce5e5848c07aad60c65ec5b7252d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/functions/src/datetime/to_unixtime.rs:143-153 | datafusion/functions/src/datetime/to_unixtime.rs:155-168 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/to_unixtime.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"39812c7b2c818afa16ff2edab5890013d5afc8a0e6d1692567950ef352496f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/core/src/dataframe/mod.rs:2726-2738 | datafusion/core/src/dataframe/mod.rs:2844-2854 \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":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98cae60b689dadf4cdc94973b6998cd24aab36d1be8c376503a4044bba074fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:190-200 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:270-280 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:363-373 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:457-467 | datafusion/functions-aggregate-common/src/utils.rs:234-245 \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":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7519ef5fb46e71e21e6208f43cb3305243cc3d8894ed3fb064197b38b2083a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 11\u002B corresponding lines): datafusion/physical-expr/src/expressions/column.rs:141-153 | datafusion/physical-expr/src/expressions/is_not_null.rs:97-109 | datafusion/physical-expr/src/expressions/is_null.rs:96-108 | datafusion/physical-expr/src/expressions/negative.rs:176-188 | datafusion/physical-expr/src/expressions/not.rs:176-188 | datafusion/physical-expr/src/expressions/similar_to_pattern.rs:123-136 | datafusion/physical-expr/src/expressions/unknown_column.rs:80-90 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/column.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d047c114bb0e88f6b782a08c499cf62cecd230bec29b92465c0dfc22da7ead4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): datafusion/physical-optimizer/src/topk_aggregation.rs:186-199 | datafusion/physical-optimizer/src/window_topn.rs:315-330 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/topk_aggregation.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9bffaa415dcf7aa2ac8f2bc766dac9f61b35af43f2d5498b4dc9940954e181"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/datasource/src/memory.rs:70-79 | datafusion/physical-plan/src/test.rs:200-209 \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":"datafusion/datasource/src/memory.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a2a42d9b81cd2b7edbe6273c87449890fed2395bb9138b6b886e9989086e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/expr/src/logical_plan/builder.rs:158-168 | datafusion/functions-aggregate/src/average.rs:492-500 \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":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39da036c18870f4b1cb8a163734d3961802ccc0111f8e6328e44faf4827c187"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/ffi/src/execution/task_ctx.rs:99-107 | datafusion/ffi/src/session/mod.rs:264-271 \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":"datafusion/ffi/src/execution/task_ctx.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f51588d41b02f11a9f9a188e1f663b7419997a97fe5c16739e5057eb65354a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/physical-expr-common/src/metrics/mod.rs:438-454 | datafusion/physical-expr-common/src/metrics/mod.rs:458-469 \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":"datafusion/physical-expr-common/src/metrics/mod.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"71031b5bbd2c0edc542c9dbbe040ef09caa8dcc472245efc3c2e8de4040c9abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): datafusion/datasource-arrow/src/file_format.rs:261-269 | datafusion/datasource-avro/src/file_format.rs:167-175 | datafusion/datasource-json/src/file_format.rs:350-360 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/datasource-arrow/src/file_format.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"12482109ab8b0a56fd2e4c55b9fae0f24db94c81072915f7fe49ab1e276a51fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/optimizer/src/utils.rs:35-48 | datafusion/optimizer/src/optimize_projections/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":"datafusion/optimizer/src/utils.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f95b0f1d0a537ceb708fe5de72e4308fb4ab4f02ec5ad36e8f2386c1d1b64b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs:41-51 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:180-188 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/fixed_size_binary.rs:80-88 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/primitive.rs:143-156 \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":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b975fe93423ae3df69937a5ca1ca749a4974fe2a7358a9ee30372bd144ea5fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/functions-aggregate/src/sum.rs:668-681 | datafusion/functions-aggregate/src/count.rs:528-534 \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":"datafusion/functions-aggregate/src/sum.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9539eae93c066a8ca22061af039bd06be0c3cdc89a77336f715492d3961c594"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/physical-plan/src/aggregates/mod.rs:3112-3120 | datafusion/physical-optimizer/src/eliminate_constant_join.rs:223-230 \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":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":3112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd608047727e1834d0557c79164a44e2b4d6f759d9990d1dd3b0ccac97d07b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/physical-plan/src/coalesce_batches.rs:247-255 | datafusion/physical-plan/src/coalesce_partitions.rs:334-341 \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":"datafusion/physical-plan/src/coalesce_batches.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24317293bf08e4f6888a54645a2ad6a5c2cc7f83573d2efa21f9198ecb08e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/ffi/src/execution_plan.rs:133-140 | datafusion/ffi/src/session/mod.rs:351-359 \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":"datafusion/ffi/src/execution_plan.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3ff0ac9a03ad6730b263e6e1644553771b06a827720f22763b4454d844b1a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/physical-expr/src/higher_order_function.rs:260-273 | datafusion/physical-expr/src/scalar_function.rs:217-229 \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":"datafusion/physical-expr/src/higher_order_function.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"304a3e0bffcbdc59a9195efc21d4950c8a58d10badb17d8bc6fcf85f2ff7bb57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): datafusion/physical-expr/src/window/window_expr.rs:133-146 | datafusion/physical-expr/src/aggregate.rs:1039-1050 \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":"datafusion/physical-expr/src/window/window_expr.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"033fe8b2e41cf59358e1d12bf048bb9548ee2e5f701aa4d5856a04b57f42d738"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:446-455 | datafusion/physical-plan/src/windows/window_agg_exec.rs:242-250 \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":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e921b64b79a168bb0638fe585ec2af90c2aa753fa5024e8c1ed1579ac6ab1f33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): datafusion/expr/src/utils.rs:795-807 | datafusion/expr/src/utils.rs:892-908 | datafusion/physical-expr/src/simplifier/const_evaluator.rs:234-246 \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":"datafusion/expr/src/utils.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cd544852bdbe4f18e358127a2f380361d851e6a22ca199c2e3c1e25fbacfd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): datafusion/ffi/src/udaf/accumulator.rs:181-190 | datafusion/ffi/src/udaf/groups_accumulator.rs:211-223 | datafusion/ffi/src/udwf/partition_evaluator.rs:182-194 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/ffi/src/udaf/accumulator.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0210a8216f1fea82fda3fea7e28064459b50d8f7faed22c72a6b9be86c22a628"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): datafusion/functions/src/unicode/character_length.rs:52-67 | datafusion/functions/src/unicode/reverse.rs:50-63 \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":"datafusion/functions/src/unicode/character_length.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a5d485df017efda8429cc4850e50b32a1fd3c39b7313fb9faba34ff61b9fd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/physical-optimizer/src/sanity_checker.rs:90-100 | datafusion/sql/src/unparser/plan.rs:2173-2183 \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":"datafusion/physical-optimizer/src/sanity_checker.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5e1b5c5ce44acc5376c6151b21565c5dafa0cdde2c60f2d1da8023089583e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:305-314 | datafusion/physical-plan/src/aggregates/single_stream.rs:300-314 \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":"datafusion/physical-plan/src/aggregates/clustered_final_stream.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b63d563b86a4c186c65cf78f8324fe6d72786ec1c359c208da1e9a345a1cb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): datafusion/physical-plan/src/joins/piecewise_merge_join/existence_join.rs:151-168 | datafusion/physical-plan/src/joins/piecewise_merge_join/right_existence_join.rs:159-175 \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":"datafusion/physical-plan/src/joins/piecewise_merge_join/existence_join.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f44b4b9125a934c97c0e3a2d540b4c0b7b8eac2c1e1f9595885cfda038be2f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:305-322 | datafusion/physical-plan/src/windows/window_agg_exec.rs:118-135 \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":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe93b01894094a984207a3a354301dbf62f58b1546a0e8e8c5c205a55730b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/common/src/hash_utils.rs:1370-1377 | datafusion/common/src/hash_utils/build_hasher.rs:104-115 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"8773200c266868f9d683f1e6c5f37e834ffbd101a9af9e675daab70ed3f55fd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): datafusion/catalog-listing/src/helpers.rs:451-463 | datafusion/datasource/src/mod.rs:403-415 \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":"datafusion/catalog-listing/src/helpers.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"1000626ee85f2722df300903cfecd4f53449618df274f4a83db37d4692cb4a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/functions-aggregate/src/min_max/min_max_bytes.rs:285-292 | datafusion/functions-aggregate/src/min_max/min_max_struct.rs:120-126 \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":"datafusion/functions-aggregate/src/min_max/min_max_bytes.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df83c378c379dceb836cb8c12f0f881f9e72e7567c47d8103fff2ea20fbc9ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/expr-common/src/operator.rs:206-222 | datafusion/pruning/src/pruning_predicate.rs:1318-1332 \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":"datafusion/expr-common/src/operator.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3a10832f1dd2f3dfb51a24236209488fb68318f7c3d1c759bd27b43c97bf78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/functions/src/datetime/now.rs:59-69 | datafusion/functions/src/datetime/to_timestamp.rs:308-317 \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":"datafusion/functions/src/datetime/now.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"788a08505ab14bbe7d54d5ec3c93874993c742d3b24a109ebbd43ae2c77ad98c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/physical-expr/src/expressions/cast.rs:643-650 | datafusion/physical-expr/src/expressions/try_cast.rs:192-198 \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":"datafusion/physical-expr/src/expressions/cast.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cedff892cc71e22e6c04c8677dd9fb479b8b4dafebd74874eba40b9234f6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/physical-plan/src/aggregates/clustered_single_stream.rs:232-240 | datafusion/physical-plan/src/aggregates/hash_stream.rs:654-668 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/clustered_single_stream.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2f74066305ac9ba4d8c7d3f0281c6752feff205cfbe0d81e04f81b377c933b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/physical-plan/src/buffer.rs:322-328 | datafusion/physical-plan/src/coalesce_batches.rs:299-308 \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":"datafusion/physical-plan/src/buffer.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"050541394debb49bc5c4eb3de579cc75f5f093a41bde04734df682c06f452060"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): datafusion/pruning/src/primitive_in_list.rs:272-278 | datafusion/pruning/src/string_in_list.rs:115-120 \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":"datafusion/pruning/src/primitive_in_list.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0d98329feb0c98c901dc9d193d00741a183117408f67d9f0ba6382330f283f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/core/src/dataframe/mod.rs:1352-1358 | datafusion/expr/src/logical_plan/builder.rs:964-970 \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":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a462574af55be17c56f5188daa08959f3d1333931084d4ec4fe638b64c263463"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): datafusion/physical-expr/src/intervals/cp_solver.rs:572-577 | datafusion/physical-expr/src/statistics/stats_solver.rs:119-124 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/intervals/cp_solver.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6fb5d0a4163e353839807cd5412b6ccea983dfcb2f7d8a44d0d1bbb8e6cbc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/datasource-avro/src/source.rs:35-43 | datafusion/datasource-csv/src/source.rs:96-105 \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":"datafusion/datasource-avro/src/source.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b12d3e8b8ec41dbc6a55e2b14de1e02627e52b5e115307b7c51d2e106b3a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/execution/src/object_store.rs:242-250 | datafusion/execution/src/parquet_encryption.rs:60-69 \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":"datafusion/execution/src/object_store.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a20e0ae655be93db38c048b19404c319791c204ae54b51e2d22e77e923e021"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/physical-plan/src/aggregates/topk/hash_table.rs:214-221 | datafusion/physical-plan/src/aggregates/topk/heap.rs:145-152 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/topk/hash_table.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13109bcc6b41658aae56e54a025f00c549e4322840e6b512f97227d986c1aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/physical-plan/src/async_func.rs:86-95 | datafusion/physical-plan/src/coalesce_batches.rs:98-107 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/async_func.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"564be1bfef3a88bb00f67d8f33cead8e237a01b87ff5caa1d9536bc5a3693fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs:1149-1157 | datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:904-912 \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":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaf83e71b9c9d4922c42e72b36ecf63a0a743687de61bb86f2ca96b6ac5ef67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): datafusion/pruning/src/primitive_in_list.rs:290-296 | datafusion/pruning/src/string_in_list.rs:124-129 \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":"datafusion/pruning/src/primitive_in_list.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e27570832f05fcb13e100473e4f4c04dc2a8b42501dcb9bc1185cf5d26bae6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): datafusion/datasource/src/sink.rs:223-233 | datafusion/physical-plan/src/analyze.rs:173-181 \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":"datafusion/datasource/src/sink.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbaff4c73861b3d0392809508a38f3d79c243923aac8a6781deafbc22bea427"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/physical-expr/src/window/aggregate.rs:119-131 | datafusion/physical-expr/src/window/standard.rs:62-72 \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":"datafusion/physical-expr/src/window/aggregate.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9d9a62e2064cb0a8979b854ea5875d7608130ad8bbd8e3e863c9099689799d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/physical-plan/src/coalesce_batches.rs:70-79 | datafusion/physical-plan/src/limit.rs:66-75 \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":"datafusion/physical-plan/src/coalesce_batches.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98d5db7d7f22eb18fe567d22b170de7e7fb80974ae81d4245ed8a1dc621da02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/physical-plan/src/filter.rs:1788-1795 | datafusion/physical-plan/src/joins/nested_loop_join.rs:2215-2223 \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":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"0176e25fc10c4139e6414a1f52364c7fb8ccc40494de179a587dbd882fa25305"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/functions-nested/src/except.rs:76-85 | datafusion/functions-nested/src/set_ops.rs:97-106 \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":"datafusion/functions-nested/src/except.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c08d80c1a5d9195bae99acacb8ed0d77de7906de8ae76439b182958a53a51d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): datafusion/datasource-arrow/src/file_format.rs:151-159 | datafusion/datasource-avro/src/file_format.rs:106-112 | datafusion/datasource-parquet/src/file_format.rs:439-445 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"datafusion/datasource-arrow/src/file_format.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4089ef6e2b6d8213e1e4385741a7960a4cbb1b8046423d21ce302648b43c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/functions-aggregate/src/covariance.rs:271-278 | datafusion/functions-aggregate/src/variance.rs:348-354 \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":"datafusion/functions-aggregate/src/covariance.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"223136ea8fd1e3c4a8e47285c67a5481c54f8995fcd8670d46c40580fb0f549b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): datafusion/functions-nested/src/array_filter.rs:70-78 | datafusion/functions-nested/src/array_first.rs:68-76 | datafusion/functions-nested/src/array_transform.rs:71-79 \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":"datafusion/functions-nested/src/array_filter.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eab816222a4d0637d496996a13e62f7364610449dc33037dc7f1fb4393e5a17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/physical-expr/src/expressions/negative.rs:116-122 | datafusion/physical-expr/src/expressions/not.rs:109-115 \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":"datafusion/physical-expr/src/expressions/negative.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81645dba3be73468f987c67bb174daea25c09a2bbf7b96201463c026e4e6fea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): datafusion/physical-plan/src/aggregates/group_values/single_group_by/bytes.rs:117-120 | datafusion/physical-plan/src/aggregates/group_values/single_group_by/bytes_view.rs:119-122 \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":"datafusion/physical-plan/src/aggregates/group_values/single_group_by/bytes.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3133246d5f58310295432ba73c95939a693fc73801df011cc57892f36501d226"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/catalog/src/memory/table.rs:503-509 | datafusion/expr-common/src/signature.rs:888-894 \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":"datafusion/catalog/src/memory/table.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da57e8502d62d7a1c7dc7b0f2767c76db96d4e0d9df6b4fed8b58e61a48f0b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): datafusion/functions-nested/src/array_has.rs:1048-1053 | datafusion/functions-nested/src/dimension.rs:132-137 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_has.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"f851410a6d36a40b947cef7bb70cd0efb041de84009d585caa6df040ebd8e053"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): datafusion/common/src/functional_dependencies.rs:845-850 | datafusion/physical-expr/src/utils/mod.rs:195-200 \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":"datafusion/common/src/functional_dependencies.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"972b56a530fe8a34142d1ff864988ac9d23567059e0ecbc098bde6ec5084ef21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): datafusion/common/src/types/canonical_extensions/json.rs:30-35 | datafusion/common/src/types/canonical_extensions/opaque.rs:29-34 | datafusion/common/src/types/canonical_extensions/timestamp_with_offset.rs:40-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 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":"datafusion/common/src/types/canonical_extensions/json.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c98c5c93225ceb2214c8fb4f74388745f142beaaa6d471abfbbe47de9b5e24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/core/src/execution/session_state.rs:2285-2291 | datafusion/execution/src/task.rs:170-176 \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":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d5efef8c8a46f03fa29a6336af1e12994e28fa54e6da58485b9701d9f1cd3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/core/src/execution/session_state.rs:2304-2310 | datafusion/execution/src/task.rs:188-194 \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":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"33901a7c16f5856f1b2950cffdc0bdcb8ca7309afd3b91ca26d679325f864144"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): datafusion/functions-nested/src/array_add.rs:86-89 | datafusion/functions-nested/src/array_subtract.rs:85-88 \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":"datafusion/functions-nested/src/array_add.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"03946c6751e9b166b05de09cb38e77c06abdb478b0be4c53616a9eeecb4c87e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): datafusion/functions-nested/src/dimension.rs:67-72 | datafusion/functions-nested/src/empty.rs:60-65 \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":"datafusion/functions-nested/src/dimension.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd75fde7887db73125b43523a73e46b7376a350bccd70cee93e1ac7b0331cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/core/src/execution/session_state.rs:2312-2318 | datafusion/execution/src/task.rs:178-186 \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":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0ccc3e3176026d25c46655590569bd77dd39703cc917da5789d694fbfc0745"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/functions-aggregate/src/bit_and_or_xor.rs:216-226 | datafusion/functions/src/string/to_hex.rs:97-104 \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":"datafusion/functions-aggregate/src/bit_and_or_xor.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b992d564dc21a7387c520aeaa0b60e5b64b6d1b05d8c1bd6e82d5bbd712cd2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): datafusion/physical-expr/src/equivalence/properties/mod.rs:1945-1951 | datafusion/physical-plan/src/joins/stream_join_utils.rs:245-251 \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":"datafusion/physical-expr/src/equivalence/properties/mod.rs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"794d964f5f8b000601d6fd8163713922a2072715179eefc9a920890f9e2d00e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): datafusion/physical-plan/src/coalesce_partitions.rs:286-289 | datafusion/physical-plan/src/limit.rs:269-272 | datafusion/physical-plan/src/sorts/sort_preserving_merge.rs:405-408 | datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:550-553 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/coalesce_partitions.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"490480f110de20d291a714b40dc42d9b1e0f65f50e2e08399acbf256a507d72e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201348 lines \u00D7 2): datafusion/expr/src/type_coercion/functions.rs:162-209 | datafusion/expr/src/type_coercion/functions.rs:253-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/type_coercion/functions.rs:253\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"79740478cdcdfce89ece479f48e52d68575b69cb47259485b7f5dcf0f3b7b6e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): datafusion/sql/src/select.rs:218-263 | datafusion/sql/src/select.rs:327-372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/select.rs:218\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/select.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9352f61bb921a329d2f6c4abf89fba11ace6ad46720ece4eaa7e57dfa239810f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): datafusion/functions-nested/src/cosine_distance.rs:88-126 | datafusion/functions-nested/src/inner_product.rs:90-128 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/cosine_distance.rs\u0060 and \u0060datafusion/functions-nested/src/inner_product.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"datafusion/functions-nested/src/cosine_distance.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb1169665d04da8d500f58e2ddabb5d35e630054fc1e0de8262e22a24403671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1264-1302 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1314-1352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1264\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fee0a61fdcee9e7fe7d050065b598b28bff420eb0d01595d83df398dc83a29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): datafusion/datasource/src/memory.rs:82-118 | datafusion/physical-plan/src/test.rs:76-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 \u0060datafusion/datasource/src/memory.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut fmt::Formatter\u0060 in one and \u0060\u0026mut Formatter\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":"datafusion/datasource/src/memory.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7880b293426415e31041296226f58732c63f46f6394d5c1216046f805afe5409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201337 lines \u00D7 2): datafusion/expr/src/logical_plan/tree_node.rs:118-149 | datafusion/expr/src/logical_plan/tree_node.rs:641-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/tree_node.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":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"202c6a6a4605fda7b8411c5a25ed623220ad376e04b7caa9e65d624b33e92b2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201336 lines \u00D7 2): datafusion/physical-plan/src/topk/mod.rs:2067-2102 | datafusion/physical-plan/src/topk/mod.rs:2462-2491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/topk/mod.rs:2067\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"2526ea2f645830a38765431a1cb882531ed441fe047066a709e46ff10aaeb7af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): datafusion/physical-plan/src/aggregates/group_values/single_group_by/bytes.rs:80-112 | datafusion/physical-plan/src/aggregates/group_values/single_group_by/bytes_view.rs:82-114 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/single_group_by/bytes.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c48400cfc8e02c837ff548219ab2470de9d2e7678c12f5d32e568010d1120b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 2): datafusion/common/src/scalar/mod.rs:5079-5107 | datafusion/common/src/scalar/mod.rs:5213-5243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/scalar/mod.rs:5213\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":5079}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2129fd45f555bdc1c6523a4d18f8e7a4043583e8a3b2ff0e8518ae726653748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): datafusion/core/src/dataframe/mod.rs:2333-2363 | datafusion/core/src/dataframe/mod.rs:2403-2433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/core/src/dataframe/mod.rs:2333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08cfa94cf6f9dad0b4adfb7cadd164356416ce8ae2f55caf080402de79a59b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201331 lines \u00D7 2): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1165-1195 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1210-1235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5e5113320f4686ec804d52a798a3b6a494fbe9aa35b646b7998d25a1a74024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): datafusion/datasource-arrow/src/file_format.rs:346-375 | datafusion/datasource-avro/src/file_format.rs:264-293 \u2014 before extracting anything, compare \u0060datafusion/datasource-arrow/src/file_format.rs\u0060 and \u0060datafusion/datasource-avro/src/file_format.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-arrow/src/file_format.rs:346\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-arrow/src/file_format.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"470b47cba31ca9be06b3048dc8283cc0aa0365bd51380c63e1d52e064ecbaff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): datafusion/physical-expr/src/equivalence/properties/mod.rs:1155-1185 | datafusion/physical-expr/src/equivalence/properties/mod.rs:1199-1229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/equivalence/properties/mod.rs:1155\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/properties/mod.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dca3ebc765fd27e0282ae9d3e3f9d27521f9c3c12788cccac0e0e28e66619f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): datafusion/physical-plan/src/aggregates/mod.rs:1982-2010 | datafusion/physical-plan/src/aggregates/mod.rs:2043-2071 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/physical-plan/src/aggregates/mod.rs:2012\u0060 calls \u0060join\u0060 and \u0060datafusion/physical-plan/src/aggregates/mod.rs:2072\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":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b66ab26bbcdd2f1d58bed154ad758bf8362bb30257e2182293b57847b41ce05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1015-1042 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1105-1131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1015\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c51476a48f6ee1bd6a7c1004303e81d40a8de50b528f981893db9fede996c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): datafusion/sql/src/unparser/dialect.rs:920-947 | datafusion/sql/src/unparser/dialect.rs:1143-1170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/unparser/dialect.rs:920\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/dialect.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcc6afea68c582a358a76b97839ae951b14cd72f736e2e10f692a13a0015698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201327 lines \u00D7 2): datafusion/datasource/src/file_scan_config/mod.rs:1450-1466 | datafusion/datasource/src/file_scan_config/mod.rs:1523-1549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource/src/file_scan_config/mod.rs:1450\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/file_scan_config/mod.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c441688ac7fd0d95e0f8652de1bbbfe5577655c2cb24729de2f59d2b9ba514"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs:599-625 | datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs:634-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 \u0060datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs:599\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98f79f68a717dcedf660c7cff15c6aebe9df4216d759862f5e2fa9d0bc2798d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 4): datafusion-cli/src/object_storage.rs:386-411 | datafusion-cli/src/object_storage.rs:471-496 | datafusion/common/src/config.rs:2509-2534 | datafusion/common/src/config.rs:3290-3315 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion-cli/src/object_storage.rs:412\u0060 calls \u0060visit\u0060 and \u0060datafusion-cli/src/object_storage.rs:497\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":"datafusion-cli/src/object_storage.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"244cc9019066f5ac3db6e1072bbd4707d0e6e1d3002458976d73577b7987ad5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): datafusion/common/src/hash_utils.rs:438-463 | datafusion/common/src/hash_utils/build_hasher.rs:291-314 \u2014 before extracting anything, compare \u0060datafusion/common/src/hash_utils.rs\u0060 and \u0060datafusion/common/src/hash_utils/build_hasher.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/hash_utils.rs:438\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b92b6130812fcd38e9619560236617add0958553c63f5fd29e050c5cee61f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): datafusion/expr/src/logical_plan/plan.rs:1716-1741 | datafusion/expr/src/logical_plan/plan.rs:1756-1781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/plan.rs:1716\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the 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, \u0060datafusion/expr/src/logical_plan/plan.rs:1714\u0060 calls \u0060Sort\u0060, \u0060Ok\u0060, \u0060TableScan\u0060 and \u0060datafusion/expr/src/logical_plan/plan.rs:1755\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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"112f8ba01be84e340e2d1934913bdf61f16f023e5d5bbe0f2a92a2c2d9a9b242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201325 lines \u00D7 3): datafusion-cli/src/functions.rs:564-583 | datafusion-cli/src/functions.rs:809-833 | datafusion-cli/src/functions.rs:973-997 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"datafusion-cli/src/functions.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dba72b993eef376de44ae55bc510651e154d198c6f7e501ba322d3333f01864"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): datafusion/expr/src/higher_order_function.rs:893-917 | datafusion/expr/src/udf.rs:82-106 \u2014 before extracting anything, compare \u0060datafusion/expr/src/higher_order_function.rs\u0060 and \u0060datafusion/expr/src/udf.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"557b1c4ca48561ba1ffeb5c98354dfc5800818f9ba4d982ac80c7e87670eaf75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): datafusion/ffi/src/config/mod.rs:33-57 | datafusion/ffi/src/config/mod.rs:123-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the 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 \u0060options\u0060 to \u0060\u0026ConfigOptions\u0060 in one and \u0060\u0026TableOptions\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":"datafusion/ffi/src/config/mod.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ca94afc03693f8dae6ea3fb54f481a23dde928b3241b085116839613b67a0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): datafusion/physical-expr/src/simplifier/const_evaluator.rs:44-68 | datafusion/physical-expr/src/simplifier/const_evaluator.rs:118-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/simplifier/const_evaluator.rs:44\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/simplifier/const_evaluator.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5edb353b34dd90d967690c39255460303bca658da2c43b6e07688d4dfee47b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): datafusion/physical-plan/src/aggregates/group_values/single_group_by/bytes.rs:40-64 | datafusion/physical-plan/src/aggregates/group_values/single_group_by/bytes_view.rs:42-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/single_group_by/bytes.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"99599044bbcc446c1f812341ec35f10db7fd3c73887331c7eb6a4ee3927fead4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): datafusion/physical-plan/src/topk/mod.rs:1858-1882 | datafusion/physical-plan/src/topk/mod.rs:2833-2854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/topk/mod.rs:1858\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e259767943b2a4b34a658b1476e889ae6c7f516a0a41001feafb287e99f2e5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): datafusion/functions/src/datetime/to_timestamp.rs:615-638 | datafusion/functions/src/datetime/to_timestamp.rs:701-724 | datafusion/functions/src/datetime/to_timestamp.rs:787-810 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"datafusion/functions/src/datetime/to_timestamp.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa58a0f091f8571d3581f207f527037c33a2b2f9da417fcd812acb8ecb027b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): datafusion/functions-nested/src/cosine_distance.rs:149-172 | datafusion/functions-nested/src/inner_product.rs:155-178 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/cosine_distance.rs\u0060 and \u0060datafusion/functions-nested/src/inner_product.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"datafusion/functions-nested/src/cosine_distance.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2cb62580dc353551a21e812958639643f2f9dd0f99aef11b2c17acd5849642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): datafusion/physical-expr/src/expressions/case.rs:168-191 | datafusion/physical-expr/src/expressions/lambda.rs:93-114 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/expressions/case.rs:168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/case.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ff2b7fd8a25301ff07f0e35e69a9fdf85e19ecc30f28fad8562dde5385be07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): datafusion/physical-plan/src/joins/hash_join/exec.rs:1442-1465 | datafusion/physical-plan/src/joins/nested_loop_join.rs:525-548 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 and \u0060datafusion/physical-plan/src/joins/nested_loop_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs:1442\u0060 it does not close everything it opens, so those exact lines 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\u0060 in one and \u0060\u0026mut Formatter\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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a3cbf3c9ec9a7cadbfdf001b66c966b0402e387ab228a3b33bd28c97912cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201323 lines \u00D7 2): datafusion/functions/src/math/round.rs:179-195 | datafusion/functions/src/math/trunc.rs:73-95 \u2014 before extracting anything, compare \u0060datafusion/functions/src/math/round.rs\u0060 and \u0060datafusion/functions/src/math/trunc.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/math/trunc.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":"datafusion/functions/src/math/round.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03a371e0d52b1e4564c9ec6ae9e35d050b92419f565a1da7ae68240bff34c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): datafusion/physical-expr/src/expressions/cast.rs:836-858 | datafusion/physical-expr/src/expressions/try_cast.rs:317-339 \u2014 before extracting anything, compare \u0060datafusion/physical-expr/src/expressions/cast.rs\u0060 and \u0060datafusion/physical-expr/src/expressions/try_cast.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/cast.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9ff3f82c17c687ac0776ffa8d9553b3ee5c76eb73d1c5d6f1ce7b7c6fba123"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): datafusion/physical-plan/src/aggregates/hash_stream.rs:470-489 | datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs:300-322 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/hash_stream.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/hash_stream.rs:470\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/physical-plan/src/aggregates/hash_stream.rs:490\u0060 calls \u0060add_part\u0060, \u0060num_rows\u0060 and \u0060datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs:324\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/hash_stream.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd09aee39d1296f5d5f1850b5c2c7df8bc16b1f6a0d5ad0a988deba482f5b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): datafusion/common/src/config.rs:2444-2465 | datafusion/common/src/config.rs:2482-2498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/config.rs:2444\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/config.rs"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a2fab3ca5f67968ea4c0141036174a1c5dc59bdc0003fe853feb169e63b2b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): datafusion/expr/src/logical_plan/tree_node.rs:86-106 | datafusion/expr/src/logical_plan/tree_node.rs:610-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/tree_node.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":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ca8201c68df688e8c98c064e1fef390f41344b7d97e7a127e51d5c79e06428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): datafusion/ffi/src/physical_expr/mod.rs:418-439 | datafusion/ffi/src/physical_expr/mod.rs:462-483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/physical_expr/mod.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c5466d5c2bca360d813d8043cc7ffcb97231ee513357d75235eb56e141f003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): datafusion/physical-expr/src/window/aggregate.rs:263-284 | datafusion/physical-expr/src/window/sliding_aggregate.rs:195-212 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/window/aggregate.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":"datafusion/physical-expr/src/window/aggregate.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"be85ddf9317908dae3ff1d808459c4ea5e073482d2c75db9bbd051e8d77d767a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:279-300 | datafusion/physical-plan/src/aggregates/single_stream.rs:274-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:279\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/clustered_final_stream.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"af833775e2b663595ab67a529d507b20cecaab423b7973bbf7e03ee1b4c17793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): datafusion/sqllogictest/src/engines/datafusion_engine/runner.rs:146-165 | datafusion/sqllogictest/src/engines/datafusion_substrait_roundtrip_engine/runner.rs:103-124 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/sqllogictest/src/engines/datafusion_engine/runner.rs:146\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sqllogictest/src/engines/datafusion_engine/runner.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cdb0e853f665d78f3aa52b2186b394f939c354c547e0e99a0254821242ee0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): datafusion/catalog/src/memory/table.rs:646-666 | datafusion/catalog/src/memory/table.rs:868-887 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/catalog/src/memory/table.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":"datafusion/catalog/src/memory/table.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cef598754bf8373afdaa680ca19fbbcaf1faf2268d7621ae90aa0b0f3f4c66b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): datafusion/functions-aggregate/src/percentile_cont.rs:306-326 | datafusion/functions-aggregate/src/percentile_cont.rs:339-359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/percentile_cont.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"9065ff3f09a2dfe52dfde8c660c64f767a092b25e180a7a48afdfc299f54c0b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): datafusion/functions/src/math/ceil.rs:98-118 | datafusion/functions/src/math/floor.rs:144-164 \u2014 before extracting anything, compare \u0060datafusion/functions/src/math/ceil.rs\u0060 and \u0060datafusion/functions/src/math/floor.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/ceil.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b07c5955476748e755bd2cb49adaa31638551981bf80b25837394dd4dfb70cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): datafusion/functions/src/regex/regexpreplace.rs:447-467 | datafusion/functions/src/regex/regexpreplace.rs:517-537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/regex/regexpreplace.rs:447\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpreplace.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e3ef67ab1795f959709061362950411773568fd4f2ae60cb09ef8099dafac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): datafusion/physical-expr-common/src/binary_map.rs:579-599 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:354-374 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/physical-expr-common/src/binary_map.rs:579\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/binary_map.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9083891448fb1f81645496f1db0719f1c929fcb57b0d3c77ad1f17c6bae45bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): datafusion/physical-plan/src/joins/cross_join.rs:547-567 | datafusion/physical-plan/src/joins/cross_join.rs:569-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 \u0060datafusion/physical-plan/src/joins/cross_join.rs:547\u0060 it begins part-way through the construct above it, so those exact lines 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":"datafusion/physical-plan/src/joins/cross_join.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa21104d49a8ec289562dfac3d2f279507e402f9ee1690910c34215f1f3f6e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): datafusion/physical-plan/src/joins/hash_join/exec.rs:1340-1360 | datafusion/physical-plan/src/joins/nested_loop_join.rs:419-438 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 and \u0060datafusion/physical-plan/src/joins/nested_loop_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs:1340\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51aaebef6eb2fc492551d442c4d58a2d336cbe2a9659a25d1750d49a0cd5984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): datafusion/common/src/scalar/mod.rs:3119-3138 | datafusion/common/src/scalar/mod.rs:3162-3181 \u2014 both copies are in the same file, so extract the block 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":3119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d33bacceafb7f7102f24b326d53920c9119c69c962378e6d4acfe3fc14e10bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): datafusion/datasource-arrow/src/file_format.rs:317-335 | datafusion/datasource-avro/src/file_format.rs:221-240 \u2014 before extracting anything, compare \u0060datafusion/datasource-arrow/src/file_format.rs\u0060 and \u0060datafusion/datasource-avro/src/file_format.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-arrow/src/file_format.rs:317\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-arrow/src/file_format.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"161638d36d58596d43fd6122cb7f94458712859998788baba6c06973c255d9d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): datafusion/datasource-json/src/file_format.rs:268-287 | datafusion/datasource-json/src/file_format.rs:291-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-json/src/file_format.rs:268\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-json/src/file_format.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f2974f4401bd3eff699a8c535d2d40f0a45727296e3be04de9ea38fe7c33c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201320 lines \u00D7 2): datafusion/functions/src/datetime/to_timestamp.rs:420-431 | datafusion/functions/src/datetime/to_timestamp.rs:529-548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/to_timestamp.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"c943284d840efd4012386133bc7df07a8a5266fe2b2cdf2d5a872e1ab079d969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): datafusion/functions/src/math/round.rs:646-664 | datafusion/functions/src/math/round.rs:684-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/round.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba1262a70d81ea36c9f0a36f9dd80c80a9be147c2c622fe568e781c5e215c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): datafusion/functions/src/string/ends_with.rs:95-115 | datafusion/functions/src/string/starts_with.rs:91-111 \u2014 before extracting anything, compare \u0060datafusion/functions/src/string/ends_with.rs\u0060 and \u0060datafusion/functions/src/string/starts_with.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/ends_with.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e3e605de954400329364b3567bbddafa4941cf079e4ae0a073056ef2956d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): datafusion/physical-plan/src/spill/mod.rs:554-573 | datafusion/physical-plan/src/spill/mod.rs:579-598 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/spill/mod.rs:554\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/spill/mod.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f472fae528ff4ed3c87f6d38bf98a0c990872ff8aa76f3ea5095de815ced9aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 3): datafusion/functions-nested/src/array_avg.rs:126-144 | datafusion/functions-nested/src/array_product.rs:130-144 | datafusion/functions-nested/src/array_sum.rs:126-144 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/array_avg.rs\u0060 and \u0060datafusion/functions-nested/src/array_product.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_avg.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1648e2ab990b1186ab0e82da3bf84e20c054717ab64c6d76fac836238bb0e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1863-1881 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1913-1931 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1943-1961 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1863\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e09d0310a7bb27497586ff343079e871480c0662552b76f1af83a2971059e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:269-287 | datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs:266-284 | datafusion/physical-plan/src/aggregates/single_stream.rs:264-282 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/clustered_final_stream.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:269\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/clustered_final_stream.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dad27e0bcf212be441eb01168c6e68b3d607b386e9c4bc6722b250c50ed6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): datafusion/expr-common/src/casts.rs:785-803 | datafusion/expr-common/src/casts.rs:805-823 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/casts.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07697e5a6c988de95131d093b9408010cbbc6d21a00abf1697b96305416b296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): datafusion/functions-nested/src/array_has.rs:663-684 | datafusion/functions-nested/src/array_has.rs:715-734 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_has.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5732f1996646991f349dde426373f42def7cd3483f6e131eb081e4d371a544"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): datafusion/physical-plan/src/windows/proto.rs:138-155 | datafusion/proto/src/physical_plan/from_proto.rs:161-179 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/physical-plan/src/windows/proto.rs:138\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/proto.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ced0a2f8f776c2fb149d05edcabe501ec77da48b1f7c57ca3ba082c23088e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): datafusion/sql/src/select.rs:822-840 | datafusion/sql/src/select.rs:981-999 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/select.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f7037525443623822318eb83dbf1e328c4eb8d3fe831b9cbffd263d0cae99c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): datafusion/datasource-csv/src/source.rs:959-976 | datafusion/datasource-json/src/source.rs:625-642 | datafusion/datasource-parquet/src/writer.rs:58-75 \u2014 before extracting anything, compare \u0060datafusion/datasource-csv/src/source.rs\u0060 and \u0060datafusion/datasource-json/src/source.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-csv/src/source.rs:959\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-csv/src/source.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be2b80e3571fadb2bc8b637be0f63793ff8533a00483a5230483834719ba737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): datafusion/ffi/src/table_provider.rs:280-298 | datafusion/ffi/src/table_provider.rs:361-379 | datafusion/ffi/src/table_provider.rs:399-418 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/ffi/src/table_provider.rs:280\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/table_provider.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"38486b983c6596573130f219576919216614ede21615388dfeb0901115c16f15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): datafusion/common/src/hash_utils/build_hasher.rs:214-231 | datafusion/common/src/hash_utils/build_hasher.rs:259-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/hash_utils/build_hasher.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils/build_hasher.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d44d8dee9ac92d46d27d9fdbd73f409a31066437ca814926ac169630e0bbcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): datafusion/common/src/scalar/mod.rs:5430-5443 | datafusion/common/src/scalar/mod.rs:5519-5536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/scalar/mod.rs:5430\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":5430}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dd3a758dc9281fccdc97ed55061319d6241a98fddee9ccc41fbe4e1cd7ee65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): datafusion/functions/src/regex/regexpcount.rs:409-423 | datafusion/functions/src/regex/regexpcount.rs:491-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"575a551a20e383106ba30feaa0bbf1a565a1edb7ef7cc401ade6e00e14c25dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs:455-472 | datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs:1115-1132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e0185b96c97163ca44efe5dfa81d1b2f92d1bd03d38bbcc6497d50d2fbc546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 4): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1015-1030 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1105-1120 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1264-1280 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1314-1330 \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 \u0060datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1015\u0060 it does not close everything it opens, so those exact lines 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":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66194f3353aa54475c0d64ece0ab4d633b8c78537886c158339c232ccd29365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): datafusion/physical-plan/src/sorts/partitioned_topk.rs:604-620 | datafusion/physical-plan/src/sorts/partitioned_topk.rs:623-639 | datafusion/physical-plan/src/sorts/partitioned_topk.rs:642-658 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/sorts/partitioned_topk.rs:604\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/partitioned_topk.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24d3ec6cb20a40f614de14c411ed4c25f52bd72dcabbfc86844c4a7db984637"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): datafusion/datasource-arrow/src/source.rs:349-365 | datafusion/datasource/src/file.rs:182-197 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-arrow/src/source.rs:349\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-arrow/src/source.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4e1dc47856dc72d9b53e7ec06f679c997ba196c604eb7cb96f59a7e0a947fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): datafusion/expr/src/logical_plan/tree_node.rs:1016-1032 | datafusion/optimizer/src/optimizer.rs:602-618 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b16521a4671b7ce5fdd6e82b7ea1038610f2daa7268e4234dd0ba6ca8b16de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): datafusion/functions-aggregate/src/stddev.rs:87-103 | datafusion/functions-aggregate/src/stddev.rs:195-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/stddev.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fed29d4a3ec05ec60c8da70fcc3534ccd408d2ef734b7ff634b05bf41491e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): datafusion/functions/src/math/gcd.rs:77-98 | datafusion/functions/src/math/lcm.rs:73-94 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/gcd.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc785782f1f94138dfbdf680ffbb7656c056cab529b855b8d79926150dfee58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): datafusion/functions/src/regex/regexpcount.rs:305-321 | datafusion/functions/src/regex/regexpcount.rs:380-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f19f1a4ff5bb3107294d0e2258f3d86d947e7719bf96895bda222600edd36f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): datafusion/physical-expr/src/higher_order_function.rs:377-393 | datafusion/physical-expr/src/scalar_function.rs:267-283 \u2014 before extracting anything, compare \u0060datafusion/physical-expr/src/higher_order_function.rs\u0060 and \u0060datafusion/physical-expr/src/scalar_function.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/higher_order_function.rs:377\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/higher_order_function.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d322edb95cb9a0c8f882d15bd07a3f5fedebd3a1c6eb1351801c451d96a7e772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): datafusion/sql/src/statement.rs:598-614 | datafusion/sql/src/statement.rs:622-637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/statement.rs:598\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/statement.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ffc57338562536c4c12720ee01a04c962b2d72cef1e3078cc5d2fcb7e74db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): datafusion/functions-nested/src/cosine_distance.rs:100-115 | datafusion/functions-nested/src/inner_product.rs:102-117 | datafusion/functions-nested/src/utils.rs:467-480 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/cosine_distance.rs\u0060 and \u0060datafusion/functions-nested/src/inner_product.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions-nested/src/utils.rs:467\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/cosine_distance.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a55da4d756ab82b56e3e04d2c2d5b6b158e71a141735efaa2d484f00fbb3237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): datafusion/core/src/execution/context/mod.rs:1190-1205 | datafusion/core/src/execution/context/mod.rs:1221-1234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd764e53ea940b9df3a1f919a961aa8373384f863f4d9eff271bc4091caecd24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): datafusion/expr/src/udaf.rs:1157-1172 | datafusion/expr/src/udaf.rs:1346-1361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/udaf.rs:1157\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/udaf.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9611142afd1faa048b929c568d4d7d063a721d9ce5b15aa0b1f988db17254db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): datafusion/functions-aggregate-common/src/aggregate/count_distinct/bytes.rs:67-82 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/bytes.rs:130-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 \u0060datafusion/functions-aggregate-common/src/aggregate/count_distinct/bytes.rs:67\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/bytes.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"172db685941ef6a8a73a1db35ee0f487422c6e9cb21ba915942a5d3ce1507033"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs:284-296 | datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs:484-499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs:284\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs:297\u0060 calls \u0060set_bit\u0060 and \u0060datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs:500\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":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f3a6cc0a3a3809af9f6ea3d547d9dfb193051bfd01576c420be4fb66099b68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): datafusion/functions-aggregate/src/array_agg.rs:1359-1374 | datafusion/functions-aggregate/src/array_agg.rs:1549-1564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9dbf59c02a5162d696b7d245f5f5d64124b76acd5619fbf609482de98467f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): datafusion/functions-nested/src/reverse.rs:160-175 | datafusion/functions-nested/src/reverse.rs:226-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":"datafusion/functions-nested/src/reverse.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cf82249cd4e713e9c83bbb442e9fa79b872ba0b77b5ccc1511d88628a88d37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): datafusion/functions/src/core/arrow_cast.rs:148-162 | datafusion/functions/src/core/arrow_try_cast.rs:120-135 \u2014 before extracting anything, compare \u0060datafusion/functions/src/core/arrow_cast.rs\u0060 and \u0060datafusion/functions/src/core/arrow_try_cast.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/core/arrow_cast.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d253537f3280e7b10486a871e26f9b1eda42f185bf7dd4257afe8fe2497b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): datafusion/functions/src/regex/regexpcount.rs:315-329 | datafusion/functions/src/regex/regexpcount.rs:360-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf0e53d0516dd8c57a9c0147e9779d5c343cfd365f8bcbed593bff0380f2961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): datafusion/functions/src/regex/regexpcount.rs:426-441 | datafusion/functions/src/regex/regexpcount.rs:513-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb176debf469ecc1acaad4ecb311f125a18fe2d8fb41fa74d542e08a0c749945"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): datafusion/functions/src/regex/regexpcount.rs:443-458 | datafusion/functions/src/regex/regexpcount.rs:479-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b17c10fe2332722ee5382d3744a7d22888e8ed2dc92e6256284744034897a3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): datafusion/optimizer/src/analyzer/function_rewrite.rs:38-53 | datafusion/optimizer/src/analyzer/type_coercion.rs:213-228 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/optimizer/src/analyzer/function_rewrite.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c262fd4c27677ba3e5470aec6b2f0d999dd40f515716941c556b4d565df9e573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): datafusion/optimizer/src/decorrelate.rs:1320-1335 | datafusion/optimizer/src/decorrelate.rs:1368-1381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a9ea5b1948651cb4e6d10c357acfc6542faace10d86a3a98de87c2c3523947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1300-1311 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1402-1417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"2478a25bcdf0825fea8d582952b82b6726d710b4349e16b76f636f7123013c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201315 lines \u00D7 4): datafusion/sql/src/unparser/expr.rs:1625-1639 | datafusion/sql/src/unparser/expr.rs:1641-1655 | datafusion/sql/src/unparser/expr.rs:1657-1671 | datafusion/sql/src/unparser/expr.rs:1672-1680 \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 \u0060datafusion/sql/src/unparser/expr.rs:1625\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87ff2229a60b41bcbe95f2a1bff2b10865863e5ad58419b201e8ea24efd6a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): datafusion/catalog/src/async.rs:288-301 | datafusion/catalog/src/async.rs:380-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 \u0060datafusion/catalog/src/async.rs:288\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/async.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b346807b62c16f3bd5ec85e0982f3a0c424b0f3e669963cc204271a4e2bc4bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/core/src/physical_planner.rs:1503-1517 | datafusion/core/src/physical_planner.rs:1518-1532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1ed4f793396337d21338edefd865584994d64fcc03eb244366bd6feda44511"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:315-329 | datafusion/ffi/src/proto/physical_extension_codec.rs:301-315 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/ffi/src/proto/logical_extension_codec.rs:315\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff041bcd930cbdcf30ee223627b6e5b506d966194132ed58df69dbed4ba219ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/functions-aggregate/src/array_agg.rs:709-723 | datafusion/functions-aggregate/src/array_agg.rs:1101-1115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc0e826a257a142fa40f1f232f87745762b8c3b17ec66689c206f2731fe49db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/functions-aggregate/src/first_last.rs:1455-1469 | datafusion/functions-aggregate/src/first_last.rs:1843-1857 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"51858f86db88a559e36eee0f86d47245e5fb48a28d6e8548ca8740430d0df1d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/functions-aggregate/src/min_max.rs:709-723 | datafusion/functions-aggregate/src/min_max.rs:837-851 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/min_max.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a39b400a182a78939eb715498799941effbbaa5102d98941629b4d4f80b4d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/functions-aggregate/src/nth_value.rs:239-253 | datafusion/functions-aggregate/src/nth_value.rs:414-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/nth_value.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcf2fc2afde8c370bdff8af0484d4767c02344fa6ec97523566fc20fc028b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/functions-nested/src/remove.rs:458-472 | datafusion/functions-nested/src/replace.rs:448-462 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060datafusion/functions-nested/src/remove.rs:458\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"datafusion/functions-nested/src/remove.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52ae70b1b77e1ff7d4968252c0849ffd8f46889548542d2ce49208aa4348859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/functions-nested/src/replace.rs:82-96 | datafusion/functions-nested/src/replace.rs:308-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":"datafusion/functions-nested/src/replace.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad394f48f2a304c97502bce8177991f5d21e621c859ee860abe32dba4586a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/functions/src/math/ceil.rs:125-139 | datafusion/functions/src/math/floor.rs:171-185 \u2014 before extracting anything, compare \u0060datafusion/functions/src/math/ceil.rs\u0060 and \u0060datafusion/functions/src/math/floor.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/ceil.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad7ba48b679ba0d4a7193b2dd6f01ecb6847f5b5e7d44f81a4f84871f8cf236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/functions/src/regex/regexpcount.rs:390-404 | datafusion/functions/src/regex/regexpcount.rs:463-477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"645a62be0a74a4f2ff6a8337a4873f109d4e940a266be823645b9e1039746f98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/physical-expr/src/expressions/case.rs:872-886 | datafusion/physical-expr/src/expressions/case.rs:959-973 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/expressions/case.rs:872\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/case.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"1656f517251423eac00930cb8f93ff93fea2642b70746a74a9e1ba2d948cecde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): datafusion/physical-expr/src/expressions/cast.rs:321-335 | datafusion/physical-expr/src/expressions/try_cast.rs:165-178 \u2014 before extracting anything, compare \u0060datafusion/physical-expr/src/expressions/cast.rs\u0060 and \u0060datafusion/physical-expr/src/expressions/try_cast.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/expressions/cast.rs:321\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the 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, \u0060datafusion/physical-expr/src/expressions/try_cast.rs:179\u0060 calls \u0060with_nullable\u0060 and \u0060datafusion/physical-expr/src/expressions/cast.rs:336\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":"datafusion/physical-expr/src/expressions/cast.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3c7721999202cff67da52553bec661bac563c13c410defabb04bda53027cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs:210-224 | datafusion/physical-plan/src/aggregates/aggregate_hash_table/common_clustered.rs:242-256 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common_clustered.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs:210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"350e2175bd99cc463b332112d10e1489665e87ef9b05a59c9067fc00c960e565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs:105-119 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/primitive.rs:199-213 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.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":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/boolean.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0e0212c3264f2df91535fb5f8963d84d7d99df7fab49fc65e3bc0626a38800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/physical-plan/src/coop.rs:375-389 | datafusion/physical-plan/src/projection.rs:610-624 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060datafusion/physical-plan/src/coop.rs:375\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/coop.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbad743af32955e379776aa7b14add379320f0b0e9dcdd98e51c11fa528c8b1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/physical-plan/src/joins/hash_join/exec.rs:1929-1943 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:625-639 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 and \u0060datafusion/physical-plan/src/joins/symmetric_hash_join.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs:1929\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"678feb9af7d20278d4f5fcdc656596b4613b504b061c227c82ce4f6647dccc99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/physical-plan/src/sorts/partial_sort.rs:319-333 | datafusion/physical-plan/src/sorts/sort.rs:1767-1781 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060datafusion/physical-plan/src/sorts/partial_sort.rs:319\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines 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 std::fmt::Formatter\u0060 in one and \u0060\u0026mut Formatter\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":"datafusion/physical-plan/src/sorts/partial_sort.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd55555dcd9e5426031138557f6607cd2468d42a034756c27491b0b41af71d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): datafusion/physical-plan/src/spill/in_progress_spill_file.rs:60-74 | datafusion/physical-plan/src/spill/in_progress_spill_file.rs:104-114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/spill/in_progress_spill_file.rs:60\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/spill/in_progress_spill_file.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f905de60b4baa7a62c2a13f2278ab15fddee5f343f94fcfc80756267fbbf99d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:325-339 | datafusion/physical-plan/src/windows/window_agg_exec.rs:138-152 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs\u0060 and \u0060datafusion/physical-plan/src/windows/window_agg_exec.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c873296f238b2f7e2570f8b185bd364c261794de6dae63483772ea86a0fb81d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): datafusion/functions-nested/src/array_avg.rs:84-98 | datafusion/functions-nested/src/array_normalize.rs:90-104 | datafusion/functions-nested/src/array_product.rs:88-102 | datafusion/functions-nested/src/array_sum.rs:84-98 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/array_avg.rs\u0060 and \u0060datafusion/functions-nested/src/array_normalize.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_avg.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67cee44991c8a21d2b47942b5c29bb4e68801d57cd39262f887efc68c5fd0b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): datafusion/functions/src/datetime/to_timestamp.rs:540-553 | datafusion/functions/src/datetime/to_timestamp.rs:624-637 | datafusion/functions/src/datetime/to_timestamp.rs:710-723 | datafusion/functions/src/datetime/to_timestamp.rs:796-809 \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":"datafusion/functions/src/datetime/to_timestamp.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7428ecd992ad72e8cd6691984296051d213aa16ede9cbfd4a6a0ce7371ee8b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): datafusion/datasource-arrow/src/file_format.rs:360-373 | datafusion/datasource-avro/src/file_format.rs:278-291 | datafusion/datasource-parquet/src/sink.rs:375-388 \u2014 before extracting anything, compare \u0060datafusion/datasource-arrow/src/file_format.rs\u0060 and \u0060datafusion/datasource-avro/src/file_format.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-arrow/src/file_format.rs:360\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-arrow/src/file_format.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2467737a52887e6bb817c86253f18a0cfefa9400e0f4481f0927be2f3866e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): datafusion/physical-plan/src/joins/asof_join.rs:600-613 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:878-891 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:684-697 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/asof_join.rs\u0060 and \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/asof_join.rs:600\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72445440d9e9fd177da6dad81df6a5e8a747a4cbe388d02a01299e5d3a04196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion-cli/src/object_storage/instrumented.rs:320-333 | datafusion-cli/src/object_storage/instrumented.rs:343-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 \u0060datafusion-cli/src/object_storage/instrumented.rs:320\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion-cli/src/object_storage/instrumented.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1b221e68c014a7eab8aedd1d6025fbc8b043622c22acbe6b4a8217ae61485d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): datafusion/catalog/src/information_schema.rs:769-782 | datafusion/catalog/src/information_schema.rs:784-797 | datafusion/catalog/src/information_schema.rs:798-809 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/catalog/src/information_schema.rs:769\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"20edaa9726afa6badd0a22dbd6308334e941f27358ca7cfe3e6a571d56d95595"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): datafusion/core/src/physical_planner.rs:2960-2973 | datafusion/core/src/physical_planner.rs:2978-2987 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"870ffa776bbc9409e41c16243523ff94011409ecb1b2e53794a1cb1afee63578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): datafusion/functions-aggregate/src/array_agg.rs:1392-1405 | datafusion/functions-aggregate/src/array_agg.rs:1577-1589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions-aggregate/src/array_agg.rs:1392\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b00d95b0e2ed10a7d863fb17c0808155ff30dc7f8642ab8827c977b56dbb082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/functions-nested/src/position.rs:239-252 | datafusion/functions-nested/src/position.rs:535-548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/position.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dffc04cc9b4c5249e49a49c87a9f4b26751771591d09132bf99770b3d058969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/functions/src/encoding/inner.rs:77-90 | datafusion/functions/src/encoding/inner.rs:150-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/encoding/inner.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc56cb6655ab7330c11638b5232afae707084e2dd220f987cbfbc7a2203a06c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/physical-expr-common/src/binary_map.rs:483-496 | datafusion/physical-expr-common/src/binary_map.rs:524-537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr-common/src/binary_map.rs:483\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/binary_map.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcded0e0be40da554987c6acaafd24c0e6e62499178b31a31758f4287b75844e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/physical-expr/src/expressions/case.rs:898-911 | datafusion/physical-expr/src/expressions/case.rs:984-997 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/expressions/case.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060datafusion/physical-expr/src/expressions/case.rs:897\u0060 calls \u0060filter_array\u0060 and \u0060datafusion/physical-expr/src/expressions/case.rs:983\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":"datafusion/physical-expr/src/expressions/case.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c1da766f9c32dd2b8770c5931a9a67fa515149909424e284649ca06b3c3ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/physical-plan/src/display.rs:590-603 | datafusion/physical-plan/src/display.rs:698-711 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/display.rs:590\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e13f56bae0571606127483705f749fb4768ddf079f7d98a0bd3ded31259ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/physical-plan/src/joins/hash_join/exec.rs:1502-1515 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:551-564 \u2014 \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 and \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.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 34 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 \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs:1502\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a3e95cb26b406bfc5213a66e282dbbde415e8fce970fdbe514acf21ca10a7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs:411-424 | datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:683-696 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs:411\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the 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, \u0060datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:680\u0060 calls \u0060clone\u0060, \u0060baseline_metrics\u0060 and \u0060datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs:409\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":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"6052bf57e62b3d22dd1863b5e8717f69ddc6d626c117649ec8dca88428d363a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/proto/src/logical_plan/from_proto.rs:348-361 | datafusion/proto/src/logical_plan/from_proto.rs:382-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 \u0060datafusion/proto/src/logical_plan/from_proto.rs:348\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/from_proto.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a66758df4a4a660832376c1f389ab327b66d7568ee0fd557600c10603238d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/sql/src/expr/function.rs:1035-1048 | datafusion/sql/src/expr/function.rs:1091-1104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/expr/function.rs:1035\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b91200499c8f67e793cf7d3d9a5853326c9e6d08d8cda2635c34b3c381e1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/sql/src/unparser/plan.rs:383-396 | datafusion/sql/src/unparser/plan.rs:1374-1387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/unparser/plan.rs:383\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37ffbbe01893631b590b38e4b9c6d742e2459a4610a696dc8203c460c1f048e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/sqllogictest/src/engines/datafusion_engine/runner.rs:76-89 | datafusion/sqllogictest/src/engines/datafusion_substrait_roundtrip_engine/runner.rs:66-79 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/sqllogictest/src/engines/datafusion_engine/runner.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7d2a5028d323dc94f707f5e26e464a7bcb18458defff486ca529dbb4b249e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:136-148 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes_view.rs:142-154 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/fixed_size_binary.rs:162-174 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f5175aff5d9b05fcb571dc21e4cad0bb3e14044e263b8878a5b64445d35c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): datafusion/sql/src/parser.rs:826-838 | datafusion/sql/src/parser.rs:1303-1315 | datafusion/sql/src/parser.rs:1390-1402 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/parser.rs:826\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/parser.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"914e2c1a040ac646ef8b279b43195dd49a69162321a9abf282a8cd2014b47c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/catalog/src/async.rs:197-209 | datafusion/catalog/src/async.rs:262-274 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/catalog/src/async.rs:197\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/async.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa37130a15b1b477264bdd1462156931b5b914a2827389dfdb0440688f3b52d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/datasource-csv/src/source.rs:795-807 | datafusion/datasource-json/src/source.rs:391-403 \u2014 before extracting anything, compare \u0060datafusion/datasource-csv/src/source.rs\u0060 and \u0060datafusion/datasource-json/src/source.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-csv/src/source.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":"datafusion/datasource-csv/src/source.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d0e96eef91b27e8e0c5779d17d2f23704902cb85f6e76d00ed40cc4888c939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/datasource-csv/src/source.rs:924-936 | datafusion/datasource-json/src/source.rs:594-606 \u2014 before extracting anything, compare \u0060datafusion/datasource-csv/src/source.rs\u0060 and \u0060datafusion/datasource-json/src/source.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-csv/src/source.rs:924\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-csv/src/source.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7091bba437d536399f4baffd171b6069b4ecc1ad85263c1fb014117978e0e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): datafusion/datasource-json/src/source.rs:414-426 | datafusion/datasource-json/src/source.rs:470-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-json/src/source.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":"datafusion/datasource-json/src/source.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c74acb3af43162435662985bb1247c40c47dc4462dcc9d923c86ea8a05edd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/expr/src/logical_plan/builder.rs:371-383 | datafusion/expr/src/logical_plan/builder.rs:406-418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"11319d0c562b04cf87b368d84c3b9ada778f693b55c0d2c48ac2ac5b64c8bf94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): datafusion/functions-aggregate/src/first_last.rs:1502-1514 | datafusion/functions-aggregate/src/first_last.rs:1889-1900 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94353b6c0f453eaaf8369a0fa134c532c9b24328ff4217c22271320d392a52d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/functions-aggregate/src/nth_value.rs:287-299 | datafusion/functions-aggregate/src/nth_value.rs:498-510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/nth_value.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec5a9191a52c816e5cc4b9dcd6a43bea9aff2f3a049ef31817b19410635ca21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/functions-nested/src/position.rs:255-267 | datafusion/functions-nested/src/position.rs:554-566 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/position.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d48333eee57e1e3e34587701b2cbe58f87fe69b7841721260153bf7e9cd2d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/functions-nested/src/range.rs:368-380 | datafusion/functions-nested/src/range.rs:449-461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/range.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab853f2f3edc67875e46138ca2ba979e795abdddfeaad7deec4b1766e823546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): datafusion/functions/src/core/overlay.rs:261-272 | datafusion/functions/src/unicode/translate.rs:192-204 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/core/overlay.rs:261\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/core/overlay.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c98db21eb357fdb6960b5ded2c9c413c55ceafe4bd340709c97e14da5e446f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): datafusion/functions/src/datetime/make_date.rs:119-129 | datafusion/functions/src/datetime/make_time.rs:122-134 \u2014 before extracting anything, compare \u0060datafusion/functions/src/datetime/make_date.rs\u0060 and \u0060datafusion/functions/src/datetime/make_time.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/make_date.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c229e8538324f270eb651539a04ceb4dec716adadc1958c2b02965ed06f5e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): datafusion/functions/src/math/abs.rs:164-175 | datafusion/functions/src/math/monotonicity.rs:332-344 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/abs.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"190c00d8a57544483b2aff5b0d742c0e164dbf4a1edfcb2baf850fd5dfe5a785"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/functions/src/regex/regexpreplace.rs:724-736 | datafusion/functions/src/utils.rs:120-132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpreplace.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9c6df3e82be8f1e49bfee81251df61267b98b7b40c147399bff23ac27f2654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/functions/src/string/common.rs:400-412 | datafusion/functions/src/string/common.rs:421-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/common.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"121e04252e7b54608dd5fc30fbed0f57ad317ac18b514a92a70b39831ca768e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/functions/src/string/ends_with.rs:81-93 | datafusion/functions/src/string/starts_with.rs:77-89 \u2014 before extracting anything, compare \u0060datafusion/functions/src/string/ends_with.rs\u0060 and \u0060datafusion/functions/src/string/starts_with.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/ends_with.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"28676c60fca2df8a91d761e67d7fa7f4d57418e7989c6f6314295e250a8e4402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/functions/src/string/ltrim.rs:88-100 | datafusion/functions/src/string/rtrim.rs:88-100 \u2014 before extracting anything, compare \u0060datafusion/functions/src/string/ltrim.rs\u0060 and \u0060datafusion/functions/src/string/rtrim.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/ltrim.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7f2b702ffc47b0ba78b55c63dd2831e399a847ae3d850b4371530aa601d586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:899-911 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:913-926 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:899\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"712a9d65f43fa1122c7d06ae3b74acb0fc611b6951db595b3bda72ac14b1535b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/physical-expr/src/window/sliding_aggregate.rs:182-194 | datafusion/physical-expr/src/window/sliding_aggregate.rs:216-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/window/sliding_aggregate.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1394044930aac640822113f6df58ba182d5e3ffdd8011955fec129bb3783f0d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:436-446 | datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs:391-403 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/clustered_final_stream.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:436\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060context\u0060 to \u0060\u0026ClusteredFinalAggregateContext\u0060 in one and \u0060\u0026ClusteredPartialAggregateContext\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":"datafusion/physical-plan/src/aggregates/clustered_final_stream.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c955ed7e53746dfaa2b0cef5a6a70e213a345a8193cd6e5bc59c04240566ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:114-125 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/fixed_size_binary.rs:139-151 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:114\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"caade5262e381c34149da4b2b3c5a75a0fc7c52f11c1abf5a2eaac32b91bfbce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): datafusion/physical-plan/src/display.rs:280-291 | datafusion/physical-plan/src/display.rs:473-485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/display.rs:280\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4245fd14a1dd8d33057e45119564986f32afe88ca8673050b4ea0b0fafc126d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/physical-plan/src/joins/piecewise_merge_join/classic_join.rs:382-394 | datafusion/physical-plan/src/joins/piecewise_merge_join/existence_join.rs:370-382 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/physical-plan/src/joins/piecewise_merge_join/classic_join.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e3c3de580c3bfadace39772f6342fedef184e308508f7b34df01fe70605c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/physical-plan/src/joins/symmetric_hash_join.rs:1132-1144 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:1146-1158 \u2014 both copies are in the same file, so extract the block 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":"datafusion/physical-plan/src/joins/symmetric_hash_join.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3f2256631a08686b11bfe6a0cd6831cc98f252342c2baf7849cd5b1a4113a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): datafusion/datasource-csv/src/file_format.rs:954-965 | datafusion/datasource-json/src/file_format.rs:589-600 | datafusion/datasource-parquet/src/sink.rs:571-582 \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 \u0060datafusion/datasource-csv/src/file_format.rs:954\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-csv/src/file_format.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcdb6c2dff0e81110a80caec705c52d0801cca39199a11e66f779a5c69850d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): datafusion/functions-aggregate-common/src/aggregate/count_distinct/bytes.rs:66-77 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/bytes.rs:129-140 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:91-102 \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 \u0060datafusion/functions-aggregate-common/src/aggregate/count_distinct/bytes.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":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/bytes.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f461d4490a59c5c737a88d28fc0751c5af85ee3306b0f9f27aa03b6f57cfb79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): datafusion/sql/src/unparser/dialect.rs:497-508 | datafusion/sql/src/unparser/expr.rs:685-696 | datafusion/sql/src/unparser/expr.rs:1827-1838 \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 \u0060datafusion/sql/src/unparser/dialect.rs:497\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/dialect.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b62a5369914a9add2be1eb336b797bc57bb1d502edbdd83615d2585f65b9b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/common/src/scalar/mod.rs:2056-2067 | datafusion/common/src/scalar/mod.rs:2130-2141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/scalar/mod.rs:2056\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d8c58a9f241c3000c47b1188647e3f66976ca0b2b6f878b3e2a34641e8ec9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/datasource/src/memory.rs:776-787 | datafusion/proto/src/physical_plan/to_proto.rs:393-404 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/datasource/src/memory.rs:776\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/memory.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"9276858ada3e99b4476407cbd85fb60bb7bd797e1f0f2caff73441da3a553b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/expr-common/src/type_coercion/binary.rs:2124-2135 | datafusion/expr-common/src/type_coercion/binary.rs:2171-2182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr-common/src/type_coercion/binary.rs:2124\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c8194249fba05a5e6443cc05ee51f6d1974747e722ef9b815dec9b30d01fbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): datafusion/expr/src/logical_plan/display.rs:542-552 | datafusion/expr/src/logical_plan/plan.rs:2367-2378 \u2014 before extracting anything, compare \u0060datafusion/expr/src/logical_plan/display.rs\u0060 and \u0060datafusion/expr/src/logical_plan/plan.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/display.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":"datafusion/expr/src/logical_plan/display.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a29db1d3b047bb1ee4d4d292241bada2c041963a43a6ee7433508c3fb62fb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/expr/src/logical_plan/tree_node.rs:524-535 | datafusion/expr/src/logical_plan/tree_node.rs:827-838 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66d0d185fab16bfe14fd66dcf75704118067ace6df0d707811486c9c51662f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/ffi/src/udtf.rs:96-107 | datafusion/ffi/src/udtf.rs:124-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":"datafusion/ffi/src/udtf.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51372523e7259fc8fe2b870fda3eb2c4b7d4600d0d094bc2d7e02bdcddf49a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions-nested/src/cosine_distance.rs:174-185 | datafusion/functions-nested/src/inner_product.rs:180-191 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/cosine_distance.rs\u0060 and \u0060datafusion/functions-nested/src/inner_product.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"datafusion/functions-nested/src/cosine_distance.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"73421143d7e520fe937d458733afe494f2967f933fcdf90a250152669ee11f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions-nested/src/flatten.rs:129-140 | datafusion/functions-nested/src/flatten.rs:164-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/flatten.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ed1fed6c35ed168cd7baadb58f63694417374838889462a5e837d1d7f86076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions-nested/src/replace.rs:132-143 | datafusion/functions-nested/src/replace.rs:358-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/replace.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94a5045745a8cddf837a007a33b66df621530512099ce03f62b81320a70eda9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions/src/core/arrow_cast.rs:119-130 | datafusion/functions/src/core/arrow_try_cast.rs:90-101 \u2014 before extracting anything, compare \u0060datafusion/functions/src/core/arrow_cast.rs\u0060 and \u0060datafusion/functions/src/core/arrow_try_cast.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/core/arrow_cast.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c83350084b0cbc7c5324f5dc5e5e4b94174301afb95ccd1417764e1ed4561a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions/src/core/arrow_field.rs:122-133 | datafusion/functions/src/core/arrow_metadata.rs:125-136 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/functions/src/core/arrow_field.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"627144510869982abbfac12c5e601839dfaac56655295db28fa6fcef8e76852e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions/src/crypto/md5.rs:54-65 | datafusion/functions/src/crypto/sha.rs:109-120 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/functions/src/crypto/md5.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"517e2f57fde8bbab874e298e181ef4aa8c29df3b5cd074bbbfc25e86893d5c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions/src/datetime/current_date.rs:99-110 | datafusion/functions/src/datetime/current_time.rs:96-107 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/current_date.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51e435cd3af5ec35447b10e15bd60844f3ee81240b6d51beaf56a35a11e9294"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions/src/datetime/make_date.rs:70-81 | datafusion/functions/src/datetime/make_time.rs:71-82 \u2014 before extracting anything, compare \u0060datafusion/functions/src/datetime/make_date.rs\u0060 and \u0060datafusion/functions/src/datetime/make_time.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/make_date.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1272b8212b4a0e7069a100fbc857bc0afcf0717ecf627f6feb6f4beff52f0fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions/src/math/common.rs:63-74 | datafusion/functions/src/math/common.rs:102-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/common.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45d9dbd51d8bbdce9e2577d1cba8b356f85a262f4fb031c5281e3163cf9556c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions/src/math/round.rs:442-453 | datafusion/functions/src/math/trunc.rs:253-264 \u2014 before extracting anything, compare \u0060datafusion/functions/src/math/round.rs\u0060 and \u0060datafusion/functions/src/math/trunc.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/round.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18d396e0f9eaafe637f15e4d5764dc9a4c41fb807d7e8232358afa6add846a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): datafusion/functions/src/regex/regexplike.rs:303-314 | datafusion/functions/src/regex/regexplike.rs:317-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/regex/regexplike.rs:303\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexplike.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0086dd314de3488abc435484499d542365dd614bffc83b2a2ef779dc4c4f7e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions/src/regex/regexpreplace.rs:431-442 | datafusion/functions/src/regex/regexpreplace.rs:495-506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpreplace.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9368f5a8e92386bbb0f29b9082051802f57bc91efe72727c4239906765fdce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions/src/string/levenshtein.rs:248-259 | datafusion/functions/src/string/levenshtein.rs:268-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/levenshtein.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"1637b479979f7db5aaef8b3d65d215d4c593dd8731b7ddb5ad7c2ec564136352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/functions/src/unicode/left.rs:46-57 | datafusion/functions/src/unicode/right.rs:46-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/functions/src/unicode/left.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"95da5dc4d016138d4a2e702b1ab4a6181881a98b2140f6bc57a0026ee51427de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): datafusion/functions/src/unicode/substr.rs:328-339 | datafusion/functions/src/unicode/substr.rs:377-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/unicode/substr.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f746a92f48664c89650e175e18114c7cc0ef3f785760f6576f98f043f90f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:902-913 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:952-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 \u0060datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:902\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6e60202b02a37b50dbe4b97efc912803924f3c597215884ae7f932fdaa9e9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:935-950 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:953-964 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:935\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f54ce51f6474c64209a61fd7c581536095f83f2486de9629715595538e824e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/mod.rs:451-462 | datafusion/physical-plan/src/aggregates/group_values/row.rs:133-142 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/group_values/multi_group_by/mod.rs:451\u0060 it does not close everything it opens, so those exact lines 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":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/mod.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"8138849d43770134ff207efb714f9443f710791ff1ae1d8464a2dcc0afd6e01f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): datafusion/physical-plan/src/coalesce_partitions.rs:74-85 | datafusion/physical-plan/src/sorts/sort_preserving_merge.rs:152-162 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/coalesce_partitions.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb11ee7af47fa864d0c7e2dc6ff1af9e8af664ec824c38587f4a181ab7585111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): datafusion/physical-plan/src/joins/piecewise_merge_join/classic_join.rs:243-251 | datafusion/physical-plan/src/joins/piecewise_merge_join/existence_join.rs:233-244 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/piecewise_merge_join/classic_join.rs:243\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/piecewise_merge_join/classic_join.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29b8cb77355087dd83a90c44a395dae8a1137b6427663b8687b34416fd08676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): datafusion/physical-plan/src/joins/proto.rs:24-35 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:700-709 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/physical-plan/src/joins/proto.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb2d5bbc6aacd9e2043b05e453e1aa9895becd855c6d3fa05ecec5cf52f24d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:651-662 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:465-476 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.rs\u0060 and \u0060datafusion/physical-plan/src/joins/symmetric_hash_join.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:651\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/exec.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e1b11cf61838e323fcaca1d9f83afdf2fd55eb826cf63bfe580bfe5b8659be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1355-1363 | datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1407-1418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1355\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bea46cedc4c53e9858d6b51c077fb7c639bb0e90e44c0608ffa426b8a54593e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): datafusion/physical-plan/src/topk/mod.rs:2105-2116 | datafusion/physical-plan/src/topk/mod.rs:2497-2505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/topk/mod.rs:2105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"63327a0508540739efa301e2d818865b3faf98f0c64b69de3e78f216789bba98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:606-617 | datafusion/physical-plan/src/windows/window_agg_exec.rs:369-380 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs\u0060 and \u0060datafusion/physical-plan/src/windows/window_agg_exec.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:606\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef6fed70270a585fc9b7af1fdf876892e79cdbb881488d9f3758549a527fa6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/proto/src/logical_plan/from_proto.rs:346-357 | datafusion/proto/src/logical_plan/from_proto.rs:363-374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/proto/src/logical_plan/from_proto.rs:346\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/from_proto.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d018bc877ab335da8ab3bba764b4da97517f0492a89f6d9b4bd05ba324c3ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/sql/src/expr/function.rs:707-718 | datafusion/sql/src/expr/function.rs:863-874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/expr/function.rs:707\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52edaf93a6da9ba07ab9c489fafabe29b41cb7d27aa6c99fd2eb447ed9eeff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/sql/src/unparser/expr.rs:924-935 | datafusion/sql/src/unparser/expr.rs:938-949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/unparser/expr.rs:924\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6f19b65457adc11228447b46940b6f2cd0738bd324b994541449b1ec75b837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): datafusion/sql/src/unparser/plan.rs:2541-2551 | datafusion/sql/src/unparser/utils.rs:379-390 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":2541}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fe352ab38464de2bb0e15a075fa9d7329e1a00fe9ed779a9fa686eccaf1244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 7): datafusion/ffi/src/query_planner.rs:134-143 | datafusion/ffi/src/table_provider.rs:287-296 | datafusion/ffi/src/table_provider.rs:330-339 | datafusion/ffi/src/table_provider.rs:368-377 | datafusion/ffi/src/table_provider.rs:406-415 | datafusion/ffi/src/table_provider.rs:467-476 | datafusion/ffi/src/udtf.rs:137-147 \u2014 there are 7 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/ffi/src/udtf.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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, \u0060datafusion/ffi/src/table_provider.rs:327\u0060 calls \u0060clone\u0060 and \u0060datafusion/ffi/src/table_provider.rs:464\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":"datafusion/ffi/src/query_planner.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42bce2c6f63c5c8f94cfe47fa6149ced8bfdc80b1f3bf6d95def6ee5c3183b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): datafusion/physical-expr/src/aggregate.rs:744-754 | datafusion/physical-expr/src/aggregate.rs:842-852 | datafusion/physical-expr/src/aggregate.rs:912-922 | datafusion/physical-expr/src/aggregate.rs:932-942 \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":"datafusion/physical-expr/src/aggregate.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"14679c11185b356693a9a6149070126093a3d6b7954bd13874a6405a3f1b81ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): datafusion/catalog/src/information_schema.rs:638-648 | datafusion/catalog/src/information_schema.rs:658-668 | datafusion/catalog/src/information_schema.rs:678-688 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/catalog/src/information_schema.rs:638\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"68546f7f04176e680a3ca28be0edb4ebf92de011e80c3f09f798f95aef75585a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): datafusion/functions-aggregate/src/first_last/state.rs:214-224 | datafusion/functions-aggregate/src/first_last/state.rs:228-238 | datafusion/functions-aggregate/src/first_last/state.rs:241-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 \u0060datafusion/functions-aggregate/src/first_last/state.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/first_last/state.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde103dd0cd7264dbccadfd24244d0732ee31e1945ee86cdbfae24c825d467bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): datafusion/functions/src/regex/regexpcount.rs:406-416 | datafusion/functions/src/regex/regexpcount.rs:443-453 | datafusion/functions/src/regex/regexpcount.rs:479-489 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"116792bfadd9fc42efbc1b0d398fb540eed9a3fd604b3a4946c826c5661bc8bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): datafusion/functions/src/string/btrim.rs:83-93 | datafusion/functions/src/string/ltrim.rs:88-98 | datafusion/functions/src/string/rtrim.rs:88-98 \u2014 before extracting anything, compare \u0060datafusion/functions/src/string/ltrim.rs\u0060 and \u0060datafusion/functions/src/string/rtrim.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/btrim.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a558bd0cf5ac5c42bb68d83061036a18769546a099899ed1d559887bc306b65b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): datafusion/physical-plan/src/joins/hash_join/exec.rs:1505-1515 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:554-564 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:379-389 \u2014 \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 and \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.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 34 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 \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs:1505\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44b9d6450aa66de1c1c83f7af2496e0fdf17de4107611c24fd7dad43674e7ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): datafusion/datasource-arrow/src/source.rs:183-190 | datafusion/datasource-arrow/src/source.rs:215-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-arrow/src/source.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-arrow/src/source.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"106fee46e3f83f41c132ebd14b556280b7152aa1f9e1d1c4cd67ba767fde57bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/datasource/src/file_compression_type.rs:131-141 | datafusion/datasource/src/file_compression_type.rs:231-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource/src/file_compression_type.rs:131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/file_compression_type.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d701a6ff958126ff3b075cdcec11a14e11e32ecb4d728d708cde8dd939175f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/expr-common/src/signature.rs:947-957 | datafusion/expr-common/src/signature.rs:1017-1027 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr-common/src/signature.rs:947\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6290290afe8d4a5b5d566fa59dcd4dd6088907f2e75e3cad97092c2ff209752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/expr/src/expr.rs:3094-3104 | datafusion/expr/src/expr.rs:3367-3377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/expr.rs:3094\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr.rs"},"region":{"startLine":3094}}}],"partialFingerprints":{"codehealthFindingId/v1":"89eab10bcf48b3c57e9d7eee21f96e8ec6ec03c0a0626d06cb7fa20d0180dde8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): datafusion/expr/src/higher_order_function.rs:1270-1280 | datafusion/expr/src/higher_order_function.rs:1354-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 \u0060datafusion/expr/src/higher_order_function.rs:1270\u0060 it does not close everything it opens, so those exact lines 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":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"88552dcc13ef25d684bdae605ab6d0c2d67cf16bdd1832967d22f2f9efad58d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): datafusion/expr/src/logical_plan/builder.rs:1468-1478 | datafusion/expr/src/logical_plan/builder.rs:1480-1489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/builder.rs:1468\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"45649175aee7f5ffab19965abec634f22af96acc413d2c97635ad13b86401346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): datafusion/expr/src/logical_plan/display.rs:768-784 | datafusion/expr/src/logical_plan/plan.rs:2540-2559 \u2014 before extracting anything, compare \u0060datafusion/expr/src/logical_plan/display.rs\u0060 and \u0060datafusion/expr/src/logical_plan/plan.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/display.rs:768\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/display.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a18e480f41fee22c95b175fcd8eea384b7f05c4d48df8761098d60a1bb8901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/expr/src/utils.rs:279-289 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:681-691 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/expr/src/utils.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9f8c8fc196616c4bce5b2487d453d336b0b529142981952f8e4153f2a6f8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/functions-aggregate/src/covariance.rs:92-106 | datafusion/functions-aggregate/src/covariance.rs:182-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/covariance.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed43c960991431fa32e326eaf480bc568fd83f9ed23c9ed21efc6b836f03aca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/functions-aggregate/src/min_max/min_max_bytes.rs:62-72 | datafusion/functions-aggregate/src/min_max/min_max_bytes.rs:76-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions-aggregate/src/min_max/min_max_bytes.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":"datafusion/functions-aggregate/src/min_max/min_max_bytes.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1c6371387b52b790c86356c1e2810485174a4fe1fb1a073e758504eca9afb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/functions/src/math/ceil.rs:54-64 | datafusion/functions/src/math/floor.rs:58-68 \u2014 before extracting anything, compare \u0060datafusion/functions/src/math/ceil.rs\u0060 and \u0060datafusion/functions/src/math/floor.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/ceil.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a635304d50d458f6f454e0f48b839b70dab46a0d3f4adebc0edd861f2b6528"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): datafusion/functions/src/unicode/find_in_set.rs:267-285 | datafusion/functions/src/unicode/find_in_set.rs:295-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/unicode/find_in_set.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e69cdcee6a0d5e32fa566c1692a03b76cb2bf8a8129609f59f42e23fdd0122d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/optimizer/src/scalar_subquery_to_join.rs:114-124 | datafusion/optimizer/src/scalar_subquery_to_join.rs:187-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/scalar_subquery_to_join.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":"datafusion/optimizer/src/scalar_subquery_to_join.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1b7862243c5ca5c94eb37cb9249cfa04283a459c13b11551852a7f3cbf171b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/physical-expr-common/src/physical_expr.rs:883-893 | datafusion/physical-expr-common/src/sort_expr.rs:384-394 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr-common/src/physical_expr.rs:883\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/physical_expr.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20cd0c3382c41d7658499b5d8a6c0beb34b7ceddf058e8960527eee9accc009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/physical-expr/src/expressions/case.rs:854-864 | datafusion/physical-expr/src/expressions/case.rs:941-951 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"datafusion/physical-expr/src/expressions/case.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"67181af663539451a3735252c3a8a30a3659b797d1a0b3af01104d440c25fb44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/physical-expr/src/expressions/cast.rs:170-180 | datafusion/physical-expr/src/expressions/try_cast.rs:53-63 \u2014 before extracting anything, compare \u0060datafusion/physical-expr/src/expressions/cast.rs\u0060 and \u0060datafusion/physical-expr/src/expressions/try_cast.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/physical-expr/src/expressions/cast.rs:181\u0060 calls \u0060target_nullable\u0060, \u0060hash\u0060 and \u0060datafusion/physical-expr/src/expressions/try_cast.rs:64\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":"datafusion/physical-expr/src/expressions/cast.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e1fa895f5c1c95e346ef852fe2d12212b6c9c90400c6b663cd433fea171e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/physical-expr/src/higher_order_function.rs:246-256 | datafusion/physical-expr/src/scalar_function.rs:203-213 \u2014 before extracting anything, compare \u0060datafusion/physical-expr/src/higher_order_function.rs\u0060 and \u0060datafusion/physical-expr/src/scalar_function.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/higher_order_function.rs:246\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/higher_order_function.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7ee07e6d7f5b89b0e2e794741f3786cf575d2ef7971a2159b45de7006fc937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:426-435 | datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs:379-389 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/clustered_final_stream.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/clustered_final_stream.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs:390\u0060 calls \u0060add_part\u0060, \u0060num_rows\u0060 and \u0060datafusion/physical-plan/src/aggregates/clustered_final_stream.rs:436\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":"datafusion/physical-plan/src/aggregates/clustered_final_stream.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0da2e3b1d3b84c4eb5e1f9f43899e07a8590e3349b52e09bec783f9eff13f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/physical-plan/src/display.rs:598-608 | datafusion/physical-plan/src/display.rs:613-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 \u0060datafusion/physical-plan/src/display.rs:598\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb7b15b0b0c8eabbcf2ea569b99b89f272ea1993869ad82cd0dad4a1ad88b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/physical-plan/src/joins/asof_join.rs:639-650 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:927-938 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/asof_join.rs\u0060 and \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/asof_join.rs:639\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff3899547da098ab2e4bb318855c54a32fd0e279e03e7f18aae1d4354dc5764"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): datafusion/physical-plan/src/joins/nested_loop_join.rs:2856-2866 | datafusion/physical-plan/src/joins/nested_loop_join.rs:3229-3238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/nested_loop_join.rs:2856\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":2856}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c43be2a94e5a0db29a0cbf6c6c18739981beb35dc37d8f5d2b2eb55a3b339e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/physical-plan/src/joins/nested_loop_join.rs:3169-3179 | datafusion/physical-plan/src/joins/nested_loop_join.rs:3268-3278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/nested_loop_join.rs:3169\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":3169}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdda1cb046bf54c4a03de0880d3120985b79efd6b3c9597ce399b93eb643c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/physical-plan/src/repartition/range.rs:411-421 | datafusion/physical-plan/src/repartition/range.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 \u0060datafusion/physical-plan/src/repartition/range.rs:411\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/repartition/range.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a71c8e84e23dd36a0a2ed95cdf40c9ad8782b4b26e6217872cd6d883e6a480b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/proto/src/logical_plan/from_proto.rs:423-433 | datafusion/proto/src/logical_plan/from_proto.rs:437-447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/from_proto.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd551ee2f6cf0cd5fd385274bf5bab92885af422a796af5471a247701170129"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/sql/src/expr/function.rs:353-363 | datafusion/sql/src/expr/function.rs:531-541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/expr/function.rs:353\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d3fb456d6cdb1520561b60603e69ea507e03ad47f443e954095e1127938158"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/sql/src/unparser/utils.rs:67-77 | datafusion/sql/src/unparser/utils.rs:90-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/unparser/utils.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/utils.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74b5615a1c473faa366f45de5774dfa0ba8c3d057850d42067a56494fba4a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): datafusion/catalog-listing/src/helpers.rs:60-69 | datafusion/expr/src/utils.rs:279-288 | datafusion/optimizer/src/push_down_filter.rs:263-272 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:681-690 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/optimizer/src/push_down_filter.rs:273\u0060 calls \u0060Between\u0060, \u0060Case\u0060 and \u0060datafusion/catalog-listing/src/helpers.rs:70\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog-listing/src/helpers.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b89dd011d634a9b1c428e6a5879b663b1c9ee6c6a8fc7b3a8ca0d8361ed307"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): datafusion/common/src/scalar/mod.rs:4737-4746 | datafusion/common/src/scalar/mod.rs:4756-4765 | datafusion/common/src/scalar/mod.rs:4775-4784 | datafusion/common/src/scalar/mod.rs:4794-4803 \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 \u0060datafusion/common/src/scalar/mod.rs:4737\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":4737}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a5b56e9f2d9859318fde4f46c69b1e4bcb78389d42c23364fb403b8b51e7ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): datafusion/functions/src/regex/regexpcount.rs:93-101 | datafusion/functions/src/regex/regexpinstr.rs:111-119 | datafusion/functions/src/regex/regexpmatch.rs:111-119 | datafusion/functions/src/utils.rs:112-121 \u2014 before extracting anything, compare \u0060datafusion/functions/src/regex/regexpcount.rs\u0060 and \u0060datafusion/functions/src/regex/regexpinstr.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/utils.rs:112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f247909348a697156effb85fbb4a54859ad073ac5110eae1bb1cfab88d69a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): datafusion/physical-plan/src/filter.rs:606-615 | datafusion/physical-plan/src/joins/asof_join.rs:280-289 | datafusion/physical-plan/src/joins/hash_join/exec.rs:1347-1356 | datafusion/physical-plan/src/joins/nested_loop_join.rs:425-434 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/asof_join.rs\u0060 and \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/filter.rs:606\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060projection\u0060 to \u0060Option\u003C\u0026[usize]\u003E\u0060 in one and \u0060Option\u003CVec\u003Cusize\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":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d2aa2f04ac6780a58a509df63fba1d48df6a782f97390eec28c9b75a207178"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): datafusion/proto-common/src/to_proto/mod.rs:425-434 | datafusion/proto-common/src/to_proto/mod.rs:441-450 | datafusion/proto-common/src/to_proto/mod.rs:457-466 | datafusion/proto-common/src/to_proto/mod.rs:473-482 \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 \u0060datafusion/proto-common/src/to_proto/mod.rs:425\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/to_proto/mod.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fad10e01a4b5ae8f88b890a4229511c4af28f947d3ec7f4095ce2a1b3e78aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): datafusion/functions/src/math/nanvl.rs:63-72 | datafusion/functions/src/math/round.rs:180-189 | datafusion/functions/src/math/trunc.rs:75-89 \u2014 before extracting anything, compare \u0060datafusion/functions/src/math/round.rs\u0060 and \u0060datafusion/functions/src/math/trunc.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/math/trunc.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":"datafusion/functions/src/math/nanvl.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c264e3225c5f3b26eba661c21c2f28b22de7924bd333a2cb450d53e94f5db7ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/common/src/dfschema.rs:754-763 | datafusion/common/src/dfschema.rs:823-832 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/dfschema.rs:754\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/dfschema.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ac8775a6274f67923f2887c8bfa0fb9fa5ddd4e50f6d5a520c1e794173acf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/common/src/hash_utils.rs:387-396 | datafusion/common/src/hash_utils/build_hasher.rs:244-253 \u2014 before extracting anything, compare \u0060datafusion/common/src/hash_utils.rs\u0060 and \u0060datafusion/common/src/hash_utils/build_hasher.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/hash_utils.rs:387\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b780b8ceff562cfb23bab55eb4ec697f844500755f06e41c37c1c727c91f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/common/src/hash_utils.rs:812-821 | datafusion/common/src/hash_utils.rs:855-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 \u0060datafusion/common/src/hash_utils.rs:812\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d195f03a62b32da184ed1bc83ef36fdcd747f9941f8b1acf0494ff72e8caea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/core/src/execution/context/mod.rs:893-902 | datafusion/core/src/execution/context/mod.rs:912-921 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf0e2e9d3279772cdb8eaed79040580d446fb2ab4f3a8421c1b8a51b268217f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/datasource-avro/src/source.rs:274-283 | datafusion/datasource-avro/src/source.rs:296-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-avro/src/source.rs:274\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-avro/src/source.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ef6fd263abc7d1612c8e20a9cc4fb9c177a2d8a9c257f8306ea58f2b4eb0ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/datasource/src/boundary_stream.rs:225-234 | datafusion/datasource/src/boundary_stream.rs:266-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 \u0060datafusion/datasource/src/boundary_stream.rs:225\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/boundary_stream.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f1359c6d8c2f981ff07f95facde793768da21f4bcc6fecd6cb33aa429db2dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): datafusion/datasource/src/memory.rs:731-736 | datafusion/physical-plan/src/joins/hash_join/exec.rs:2324-2333 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/datasource/src/memory.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66e3079809ca28509b622ae8b60b8de1bd53b38503ffde8e9aafd99f6fb1ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): datafusion/expr/src/expr.rs:1972-1980 | datafusion/optimizer/src/optimize_projections/mod.rs:719-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr.rs"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5bb77c23ddf424f98cab5758a4323991b017a4a3b45a0636437fbec8a831a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/expr/src/expr_fn.rs:912-921 | datafusion/expr/src/expr_fn.rs:952-961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/expr_fn.rs:912\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_fn.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"219e1759e059d49bc4eae38b73f8ab63c1447ddc6a0ae0b0df36347100e32b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/expr/src/higher_order_function.rs:1410-1419 | datafusion/physical-expr/src/expressions/lambda.rs:330-339 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"634654b59a7e15c677cdede9c827959a79a37b6e0f0a500789b760425355d6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/expr/src/logical_plan/builder.rs:2018-2027 | datafusion/physical-plan/src/joins/utils.rs:331-340 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060left\u0060 to \u0060\u0026DFSchema\u0060 in one and \u0060\u0026Schema\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":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":2018}}}],"partialFingerprints":{"codehealthFindingId/v1":"3177998b6440bb95cb1dac3b75d04f58b77a32b16465b4afa6aadfb74958d803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/expr/src/logical_plan/display.rs:355-364 | datafusion/expr/src/logical_plan/plan.rs:2194-2203 \u2014 before extracting anything, compare \u0060datafusion/expr/src/logical_plan/display.rs\u0060 and \u0060datafusion/expr/src/logical_plan/plan.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/display.rs:355\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/display.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bea63edec6d244db38bac8fcbed73981e6c5715e2ca65b056c6d41313955fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): datafusion/expr/src/logical_plan/display.rs:398-405 | datafusion/expr/src/logical_plan/plan.rs:2234-2243 \u2014 before extracting anything, compare \u0060datafusion/expr/src/logical_plan/display.rs\u0060 and \u0060datafusion/expr/src/logical_plan/plan.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/display.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/expr/src/logical_plan/display.rs:407\u0060 calls \u0060push\u0060 and \u0060datafusion/expr/src/logical_plan/plan.rs:2245\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":"datafusion/expr/src/logical_plan/display.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adc1a4149971839410e86deb8739695674341cee2bf518092ab875c0018d54a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/expr/src/logical_plan/plan.rs:3689-3698 | datafusion/expr/src/logical_plan/plan.rs:3765-3774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/plan.rs:3689\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":3689}}}],"partialFingerprints":{"codehealthFindingId/v1":"061664801e6b99b74628ffb13a3b9b7f4a02d53b6e0f402842cc44f5300b369f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/expr/src/type_coercion/functions.rs:1067-1076 | datafusion/expr/src/type_coercion/functions.rs:1095-1104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/type_coercion/functions.rs:1067\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"33031c17b65c45bb70406aa0408890cee5b716669dba4a2a20a07aaa4ced5fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/functions-nested/src/utils.rs:237-247 | datafusion/functions/src/utils.rs:134-143 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/utils.rs\u0060 and \u0060datafusion/functions/src/utils.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 \u0060datafusion/functions-nested/src/utils.rs:237\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/utils.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d899acc03e9eebafd56cb80298d783992e76140f2aaaede87daf5a721b4792"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): datafusion/functions/src/core/overlay.rs:270-278 | datafusion/functions/src/core/overlay.rs:282-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 \u0060datafusion/functions/src/core/overlay.rs:270\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/core/overlay.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f0d7229991b103ebe3f2dc2595602491f23a6a23c14f4b16e2cece9226e124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/functions/src/math/round.rs:200-209 | datafusion/functions/src/math/trunc.rs:95-104 \u2014 before extracting anything, compare \u0060datafusion/functions/src/math/round.rs\u0060 and \u0060datafusion/functions/src/math/trunc.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/math/trunc.rs:95\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/round.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"27871ec9f13254b412b503bf7641ef7c30d616eca98a6cf7596e190c5800d77d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): datafusion/functions/src/string/chr.rs:39-47 | datafusion/functions/src/string/chr.rs:51-60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/string/chr.rs:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"datafusion/functions/src/string/chr.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c943bd0a80ff621ae8c8e396e6309503ce5c54d56519e254c80f071878ef250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/functions/src/string/levenshtein.rs:261-270 | datafusion/functions/src/string/levenshtein.rs:281-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/levenshtein.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"32203dc62338b159c368892bc7b207b690e3e8bbac6068d620fd03a241b80bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): datafusion/functions/src/string/repeat.rs:326-334 | datafusion/functions/src/string/split_part.rs:536-545 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/functions/src/string/repeat.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"394e338b45357420b666b3650323ce798030206f3aa1399c0aba4a99397074e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): datafusion/functions/src/string/repeat.rs:334-342 | datafusion/functions/src/string/repeat.rs:347-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/repeat.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b6e4c57f3fa5db1cb2cc56a851117e57e9a4992e4444cc7d948847256445da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/optimizer/src/push_down_filter.rs:1143-1152 | datafusion/optimizer/src/push_down_filter.rs:1224-1240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/push_down_filter.rs:1143\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a340bb2249ab6770fc37147cfd9b938b4b870e0401e1cfe8a59778e0066bbfd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/physical-expr-common/src/binary_map.rs:637-646 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs:398-407 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/physical-expr-common/src/binary_map.rs:637\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/binary_map.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"d930a032c33adb8fc63230a4e16e167c1f69c0c82f4ca3750072df9a9900564e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/physical-expr-common/src/binary_view_map.rs:415-424 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes_view.rs:327-336 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/physical-expr-common/src/binary_view_map.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":"datafusion/physical-expr-common/src/binary_view_map.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b5707f09fe87f0de12a36d884b4b0d3439dc000016ca060a6507ef578cea89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): datafusion/physical-optimizer/src/projection_pushdown.rs:453-461 | datafusion/physical-optimizer/src/projection_pushdown.rs:674-683 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-optimizer/src/projection_pushdown.rs:453\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/projection_pushdown.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"194fa67f8f8ef1fc83c502891a8bd572362d3a81310e4b45d453fadea5581525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs:152-161 | datafusion/physical-plan/src/aggregates/aggregate_hash_table/common_clustered.rs:187-196 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common_clustered.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs:152\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"626a98a2603d3e8b098e0fd3bca1ecc0acfee5c160959fb2450c9c2e9ee8f4e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): datafusion/physical-plan/src/aggregates/mod.rs:2601-2612 | datafusion/proto/src/physical_plan/to_proto.rs:46-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/mod.rs:2601\u0060 it does not close everything it opens, so those exact lines 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 \u0060aggr_expr\u0060 to \u0060\u0026Arc\u003CAggregateFunctionExpr\u003E\u0060 in one and \u0060Arc\u003CAggregateFunctionExpr\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":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":2601}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5601f01421d446eecb7c8c3266c78a440a4cffda5748717fbd115cd0ed43cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/physical-plan/src/aggregates/mod.rs:2690-2699 | datafusion/physical-plan/src/aggregates/mod.rs:2700-2709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"b183c4ae5f04f7f571a25bcc10ec751019d33966655d945d692370b6feb1d9df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/physical-plan/src/display.rs:308-317 | datafusion/physical-plan/src/display.rs:503-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/display.rs:308\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac1f14815c76ccfae4d779049700aa1b6f920af11e1247de125d5ed56f4cb00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/physical-plan/src/display.rs:609-618 | datafusion/physical-plan/src/display.rs:717-726 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/display.rs:609\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"1611ce88cad081c28c52b99bddfe8a6cd198a859fd7d55f03e569bfe54e0c0d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): datafusion/physical-plan/src/joins/asof_join.rs:733-741 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:1025-1034 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/asof_join.rs\u0060 and \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/asof_join.rs:733\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb71dd6c4eca6ae9e666ba757420805d3282c4b13766e32db5ede6933badc30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/physical-plan/src/joins/proto.rs:42-51 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:847-856 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/physical-plan/src/joins/proto.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd010e3cdb740ed2f2b34c08a834aa81e8f257994709193ba5c92659dc8d747f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs:543-552 | datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs:579-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs:543\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"a398305d2a19de9e9c67053ecfbf991f5e405cf4f6783de3ddd6b9b9e7181361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/physical-plan/src/sorts/sort.rs:2067-2076 | datafusion/physical-plan/src/sorts/sort_preserving_merge.rs:434-443 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060datafusion/physical-plan/src/sorts/sort.rs:2067\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/sort.rs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"4995dec482ff5180b1acd9583dcf51aec652732bf3f012766653650ce7e10dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/physical-plan/src/spill/mod.rs:225-234 | datafusion/physical-plan/src/spill/mod.rs:260-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 \u0060datafusion/physical-plan/src/spill/mod.rs:225\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/spill/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0457745ffcd09a2d51589f00ec9915d9d536828e5c08635a6dbe8a1be942e4ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:421-430 | datafusion/physical-plan/src/windows/window_agg_exec.rs:209-218 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs\u0060 and \u0060datafusion/physical-plan/src/windows/window_agg_exec.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the 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, \u0060datafusion/physical-plan/src/windows/window_agg_exec.rs:220\u0060 calls \u0060maintains_input_order\u0060 and \u0060datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:432\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":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e994162601ca00756a2c8ff03d4fae548265965c46f3a90fc28feccb36122f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/sql/src/expr/function.rs:1023-1032 | datafusion/sql/src/expr/function.rs:1079-1088 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/expr/function.rs:1023\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"88322fd74de91020ea7f2083e2fbe783850b1fb116dd75bbe03a128ccd28696b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/sql/src/unparser/expr.rs:1601-1610 | datafusion/sql/src/unparser/expr.rs:1682-1691 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"9161a3fb64090a4b3c462f611b8756fcc2a32a39022df978f4ec118e857b082e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/sql/src/unparser/plan.rs:436-445 | datafusion/sql/src/unparser/plan.rs:560-569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/unparser/plan.rs:436\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb17141fc53c00389418d10ee92725a98510f6744fd89e8db0792a2ed8da421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/substrait/src/logical_plan/consumer/rel/cross_rel.rs:18-27 | datafusion/substrait/src/logical_plan/consumer/rel/join_rel.rs:25-34 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/substrait/src/logical_plan/consumer/rel/cross_rel.rs:18\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/rel/cross_rel.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f97652ba50196cf0fe7d8cdd28e941b6c7339f69f65b2b9d170b77e49f2d1d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): datafusion/ffi/src/catalog_provider.rs:225-233 | datafusion/ffi/src/catalog_provider_list.rs:189-197 | datafusion/ffi/src/schema_provider.rs:235-243 | datafusion/ffi/src/table_provider_factory.rs:93-101 | datafusion/ffi/src/udtf.rs:193-202 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/catalog_provider.rs\u0060 and \u0060datafusion/ffi/src/catalog_provider_list.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/ffi/src/catalog_provider.rs:225\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/catalog_provider.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5c39b8a37f89b7a109ac37f94c7a1da9b39084de8899028cf9f4191bb8e22f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): datafusion/datasource/src/boundary_stream.rs:228-236 | datafusion/datasource/src/boundary_stream.rs:269-277 | datafusion/datasource/src/boundary_stream.rs:366-374 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource/src/boundary_stream.rs:228\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/boundary_stream.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e622f88a6b10fd8c71006679361cef215232dd02e8083111d8a493d79bf45902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): datafusion/ffi/src/catalog_provider.rs:185-193 | datafusion/ffi/src/catalog_provider_list.rs:150-158 | datafusion/ffi/src/schema_provider.rs:193-201 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/catalog_provider.rs\u0060 and \u0060datafusion/ffi/src/catalog_provider_list.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/ffi/src/catalog_provider.rs:185\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the 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, \u0060datafusion/ffi/src/schema_provider.rs:204\u0060 calls \u0060clone\u0060 and \u0060datafusion/ffi/src/catalog_provider.rs:196\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":"datafusion/ffi/src/catalog_provider.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2041ad3d409d818533ed66c1ac45908035a0da0b6c8ea09911d7719f142eba22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): datafusion/functions-nested/src/except.rs:209-217 | datafusion/functions-nested/src/set_ops.rs:480-488 | datafusion/functions-nested/src/set_ops.rs:591-599 \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":"datafusion/functions-nested/src/except.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af2e7a72d84be471a5544c93429717e92ca352e677b4628a0dac7640f50ff49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): datafusion/functions/src/regex/regexpinstr.rs:214-220 | datafusion/functions/src/regex/regexpinstr.rs:232-240 | datafusion/functions/src/regex/regexpinstr.rs:252-260 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"datafusion/functions/src/regex/regexpinstr.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7e852b24eca7d24094b8e4cac902371d429f35e6bda527152343daf3b066f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): datafusion/common/src/hash_utils.rs:495-503 | datafusion/common/src/hash_utils/build_hasher.rs:337-343 \u2014 before extracting anything, compare \u0060datafusion/common/src/hash_utils.rs\u0060 and \u0060datafusion/common/src/hash_utils/build_hasher.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/hash_utils.rs:495\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ec1fdf09dd60e2ae5b487a3be7a4be14112d841166e25cee1989f0a2abd41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/common/src/utils/mod.rs:151-159 | datafusion/common/src/utils/mod.rs:201-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/utils/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"23042ce3c8a8cf3d22c5fee636d8f9091b077c99359271a58993b768ccd67048"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/datasource-parquet/src/metadata.rs:767-775 | datafusion/datasource-parquet/src/metadata.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-parquet/src/metadata.rs:767\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/metadata.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fbdc2dfb864afecbfb1166cad0566ed4e56fd64f20d9a943efa7a778a86e4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/datasource/src/memory.rs:531-539 | datafusion/physical-plan/src/test.rs:321-329 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/datasource/src/memory.rs:531\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/memory.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c8a24394826d3c0a890101d2587922420f4fc48ff954bc04e29da998a5d740"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/expr-common/src/sort_properties.rs:55-63 | datafusion/expr-common/src/sort_properties.rs:75-83 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr-common/src/sort_properties.rs:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/sort_properties.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b850705501885a86e1d496b3ea32f88340106c5f7e0afc266e38de921384dbe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): datafusion/expr/src/expr.rs:2874-2882 | datafusion/optimizer/src/eliminate_filter.rs:250-257 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr.rs"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"201ce84eb8fea3988d8c8aa7788f8d06f81c782cf65f4457b2eec991c59b482b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/expr/src/higher_order_function.rs:1245-1253 | datafusion/sql/src/expr/function.rs:426-436 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/expr/src/higher_order_function.rs:1245\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a35ce81dc9f32d7f0e49fb426c77dec0bf2136efd10f5f59acc57d213e61b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/expr/src/utils.rs:1293-1301 | datafusion/expr/src/utils.rs:1317-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 \u0060datafusion/expr/src/utils.rs:1293\u0060 it does not close everything it opens, so those exact lines 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 \u0060expr\u0060 to \u0060\u0026Expr\u0060 in one and \u0060Expr\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":"datafusion/expr/src/utils.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf7ddbee9ad7c891836d0de97a81701fb82e637f6a5da16e7048fe9184c13db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/ffi/src/config/mod.rs:84-92 | datafusion/ffi/src/config/mod.rs:97-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/config/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f2f6bc6ebe9d24f0e5d8a8c4f9b3b4eff8508db12602959c2e046508a26de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:197-205 | datafusion/ffi/src/proto/physical_extension_codec.rs:183-191 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1236b0b93772bc6a3f07ecfedba919f5ed5741d4a775427b1367ceed6a4bdbac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:223-231 | datafusion/ffi/src/proto/physical_extension_codec.rs:209-217 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d440e8917a04b2d7d6f670f5d8a867c010d795bf05f2fb57d5b90c440207ce79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:249-257 | datafusion/ffi/src/proto/physical_extension_codec.rs:235-243 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd523b8f8d8185c92d436929b65608c38a67ade23fa86b28ae1b3154f4e65470"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/functions-aggregate/src/average.rs:289-297 | datafusion/functions-aggregate/src/average.rs:311-319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"55da3e66226710f40b892eeab2bf51ad8545b9ef0e1c6ef139f9a3b89411b81a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/functions-aggregate/src/covariance.rs:340-348 | datafusion/functions-aggregate/src/regr.rs:677-685 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/functions-aggregate/src/covariance.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d8d97ab5b949745a4085c12499d8662a03c4140aeacee8d480c1009fb429f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/functions-aggregate/src/first_last.rs:324-332 | datafusion/functions-aggregate/src/first_last.rs:1651-1659 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de3a862750716128048e371f5c6ac423d4b33cdfb0962f4ed695796deb41b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/functions-nested/src/array_scale.rs:162-171 | datafusion/functions-nested/src/utils.rs:526-535 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060datafusion/functions-nested/src/utils.rs:526\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_scale.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aeaa92afe08533354e19a31e201162e0dc7ab2d6b6504c4f102f443432c022"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/functions-nested/src/concat.rs:102-110 | datafusion/functions-nested/src/concat.rs:193-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/concat.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a14121c4dc555b4d80759c344a6fa7c8477b460ccffdf8e024566614ed4cc9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/functions-nested/src/remove.rs:106-114 | datafusion/functions-nested/src/remove.rs:345-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/remove.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0d9ad27f34a3a365d1f671fec852b421dafa0c6c33f0fcfa9b3b1cd7e15ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): datafusion/functions-nested/src/remove.rs:227-233 | datafusion/functions-nested/src/replace.rs:122-130 | datafusion/functions-nested/src/replace.rs:348-356 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/remove.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecd5df588f4c03217c99996f5bdae3ec78203327282d95e13ccb8e01ae247ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/functions-nested/src/utils.rs:223-231 | datafusion/functions/src/utils.rs:107-115 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/utils.rs\u0060 and \u0060datafusion/functions/src/utils.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 \u0060datafusion/functions-nested/src/utils.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":"datafusion/functions-nested/src/utils.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c303c0368e78b14b177579aaa1ef8bfc85c3999499b7b5bdc50746f4b812e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/functions-table/src/generate_series.rs:915-924 | datafusion/functions-table/src/generate_series.rs:941-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 \u0060datafusion/functions-table/src/generate_series.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":"datafusion/functions-table/src/generate_series.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe496302aeebf0e418331030ae0a112682958c2e70b8e82d4e5d5d628530e01f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/functions/src/crypto/basic.rs:118-131 | datafusion/functions/src/crypto/basic.rs:149-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/crypto/basic.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":"datafusion/functions/src/crypto/basic.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de0839611924f4daa77d9bbfef01cef6127dd2b2e1ba63ec5d1a25ae65e423e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/functions/src/math/monotonicity.rs:94-102 | datafusion/functions/src/math/monotonicity.rs:191-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/monotonicity.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc570fd40fb1f07f0d3bc60f5e2f88f9603bfcbb6aff5a34c4e3bc658df7cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:995-1003 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1085-1093 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:995\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad15046b2017edff064f895d4695523eefe3d5eda4490850ef8add8daee40c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-expr/src/higher_order_function.rs:462-470 | datafusion/physical-expr/src/scalar_function.rs:353-361 \u2014 before extracting anything, compare \u0060datafusion/physical-expr/src/higher_order_function.rs\u0060 and \u0060datafusion/physical-expr/src/scalar_function.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/higher_order_function.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dda110cb30f00cb02d17066f3516f5d00be5645b83cbef5e57e98c4c0a791ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-expr/src/partitioning.rs:1004-1012 | datafusion/physical-plan/src/repartition/mod.rs:871-879 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/physical-expr/src/partitioning.rs:1004\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/partitioning.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd56b00193e3a15d89f9af59307fb678fd30e94fe3aeac4d1734ff64e108651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs:785-793 | datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs:799-807 \u2014 both copies are in the same file, so extract the block 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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70665ac1882a5d838f462e74b8a747b5ba72fe8f87a42f5c3d3161508ec8851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): datafusion/physical-optimizer/src/topk_repartition.rs:73-81 | datafusion/sqllogictest/src/test_context/custom_sort_pushdown.rs:130-136 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/topk_repartition.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3211b2bca05df0edb40dadf225bfec68bf8b2011092edcd67355d984d2e5b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/physical-plan/src/aggregates/clustered_single_stream.rs:153-164 | datafusion/physical-plan/src/aggregates/single_stream.rs:155-166 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/clustered_single_stream.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf92bff359026d270c0cbc64cd25d0c3539fc5fd9d07cd5530a6fe1c3282c70b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/mod.rs:508-516 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/mod.rs:887-895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/mod.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b07283ca74e3e48d6ab79a1bb6b87a111244693167a1ef1e4d7e22e21c4f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/display.rs:294-302 | datafusion/physical-plan/src/display.rs:488-496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/display.rs:294\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f36e6139fb2503b5e2bb3e921d9ff507f83e65c42b7eb4ad57d7c78d29f6ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/joins/hash_join/exec.rs:2170-2178 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:886-894 \u2014 \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 and \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.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 34 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 \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs:2170\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e3f81839debd2a9fc8a29be355a8c5fc2c0d288646f0d81a9927a6bb98e9f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): datafusion/physical-plan/src/joins/sort_merge_join/metrics.rs:30-36 | datafusion/physical-plan/src/joins/utils.rs:1990-1998 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/physical-plan/src/joins/sort_merge_join/metrics.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8579bd2285aef033b1aad11df8e9cbcb26be7e805b9800796aa42547efd75d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/joins/symmetric_hash_join.rs:576-584 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:596-604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/symmetric_hash_join.rs:576\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/symmetric_hash_join.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a6af9b04ad89b281bb0698a7129883ade89a8ec4ae2d255a49807bdcc0ded8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/projection.rs:1142-1150 | datafusion/physical-plan/src/projection.rs:1160-1168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/projection.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb89a883037c83a993d4e09db2fa7dcda5a7c694c813b29e7c2e75331b12a152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): datafusion/physical-plan/src/union.rs:185-193 | datafusion/physical-plan/src/union.rs:683-688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/union.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"348ca46f2ffb7db409ee1eb113a1364ad0647c81cfd70d7c36764e612e057ad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:342-350 | datafusion/physical-plan/src/windows/window_agg_exec.rs:323-331 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs\u0060 and \u0060datafusion/physical-plan/src/windows/window_agg_exec.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eebefc9b362fc0031e8d7915c3e6f5e78e39ed2b70ea69a881ebefed658c690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): datafusion/physical-plan/src/windows/proto.rs:32-37 | datafusion/proto/src/physical_plan/to_proto.rs:91-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 \u0060datafusion/physical-plan/src/windows/proto.rs:32\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/proto.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3244c6fc011d18c1cee0b467477f725dd32add8233430d0020b9c2690ac1ad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/windows/proto.rs:37-45 | datafusion/physical-plan/src/windows/proto.rs:47-55 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/proto.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbe242751c5c1a77e97220c77c6ac6bf2f9b0065339a45c6d787b7cd4d341e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/proto/src/physical_plan/to_proto.rs:99-108 | datafusion/proto/src/physical_plan/to_proto.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/physical_plan/to_proto.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4aea52f538e663fa1a62640d6d88714dd8f4ef17613b6f635db8e927df377c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/sql/src/expr/function.rs:318-326 | datafusion/sql/src/expr/function.rs:811-819 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/expr/function.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. 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":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f2ff826f473904406f427166599301bbc047cda77ead4204e481ee91686a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 7): datafusion/physical-plan/src/async_func.rs:166-172 | datafusion/physical-plan/src/coalesce_batches.rs:174-181 | datafusion/physical-plan/src/limit.rs:192-198 | datafusion/physical-plan/src/limit.rs:482-488 | datafusion/physical-plan/src/sorts/sort_preserving_merge.rs:279-286 | datafusion/physical-plan/src/unnest.rs:232-238 | datafusion/physical-plan/src/windows/window_agg_exec.rs:257-263 \u2014 there are 7 copies across 6 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/async_func.rs:166\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/async_func.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"879ace1f1c011744cc8065b9c0335dd07d8621ac8a7e53f15ee1b85ca196a616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): datafusion/ffi/src/catalog_provider.rs:224-231 | datafusion/ffi/src/catalog_provider_list.rs:188-195 | datafusion/ffi/src/schema_provider.rs:234-241 | datafusion/ffi/src/table_provider.rs:539-549 | datafusion/ffi/src/table_provider_factory.rs:92-99 | datafusion/ffi/src/udtf.rs:192-199 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/catalog_provider.rs\u0060 and \u0060datafusion/ffi/src/catalog_provider_list.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/ffi/src/table_provider.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/catalog_provider.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80b57c4a4e8a15f5b8f983446de17f8264afbf291a5e879f9d974926381e85c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): datafusion/functions-nested/src/string.rs:192-199 | datafusion/functions/src/crypto/digest.rs:59-66 | datafusion/functions/src/regex/regexplike.rs:70-77 | datafusion/functions/src/string/btrim.rs:78-85 | datafusion/functions/src/string/ltrim.rs:83-90 | datafusion/functions/src/string/rtrim.rs:83-90 \u2014 before extracting anything, compare \u0060datafusion/functions/src/string/ltrim.rs\u0060 and \u0060datafusion/functions/src/string/rtrim.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/string.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f11749e5375e1af2ab6ba7ce05a945dfeb45a6854ed98ccdce0d2c98f4b2d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): datafusion/physical-plan/src/aggregates/mod.rs:2170-2177 | datafusion/physical-plan/src/buffer.rs:165-172 | datafusion/physical-plan/src/coalesce_partitions.rs:155-162 | datafusion/physical-plan/src/filter.rs:698-705 | datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:466-473 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/mod.rs:2170\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6de61974427110c4a8a9c4f0d2a22854eb4a5ca0fbdc0f909812698894dc1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): datafusion/ffi/src/udaf/accumulator.rs:94-101 | datafusion/ffi/src/udaf/accumulator.rs:168-175 | datafusion/ffi/src/udwf/partition_evaluator.rs:101-108 | datafusion/ffi/src/udwf/partition_evaluator.rs:126-133 \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 \u0060datafusion/ffi/src/udaf/accumulator.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":"datafusion/ffi/src/udaf/accumulator.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbae6ea1173c3130df2aec707e3c98bb485e454144ea878470fc9e3a707c551"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): datafusion/functions/src/math/monotonicity.rs:435-442 | datafusion/functions/src/math/monotonicity.rs:473-480 | datafusion/functions/src/math/monotonicity.rs:511-518 | datafusion/functions/src/math/monotonicity.rs:638-645 \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":"datafusion/functions/src/math/monotonicity.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdbf81f70dd9f2d928fb4aa0ca76cda7bca8c24e736c45a2df90998c5371650"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): datafusion/common/src/scalar/mod.rs:2827-2834 | datafusion/common/src/scalar/mod.rs:5088-5095 | datafusion/common/src/scalar/mod.rs:5223-5230 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75a59c3c2ba7ac7c4618641d2c631d2d6b514040cf640ac1910db8065d05d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): datafusion/functions-aggregate/src/average.rs:289-296 | datafusion/functions-aggregate/src/average.rs:311-318 | datafusion/functions-aggregate/src/average.rs:414-421 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc673984e7e63269324e210ae6f125ea599a97aab80a28aef87a7b5b50b59b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): datafusion/functions-aggregate/src/covariance.rs:341-348 | datafusion/functions-aggregate/src/regr.rs:678-685 | datafusion/functions-aggregate/src/variance.rs:378-385 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060datafusion/functions-aggregate/src/variance.rs:378\u0060 it does not close everything it opens, so those exact 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":"datafusion/functions-aggregate/src/covariance.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6f0cabe7298b17e088a046dbaf61fbc4081ddd89e97295d42e0f9d658aa58f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): datafusion/functions-table/src/generate_series.rs:918-925 | datafusion/functions-table/src/generate_series.rs:944-951 | datafusion/functions-table/src/generate_series.rs:972-979 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions-table/src/generate_series.rs:918\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-table/src/generate_series.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ec830d07d7ea2040f48ec7b5575f95f3bfa5088f6df44e2e4f65d3f03a3062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): datafusion/functions/src/string/levenshtein.rs:245-252 | datafusion/functions/src/string/levenshtein.rs:265-272 | datafusion/functions/src/string/levenshtein.rs:285-292 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"datafusion/functions/src/string/levenshtein.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4c1dcd38ac91cb5d2d0a2c13c84bf106932f067cf760366f0d7d9f631b8419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/common/src/hash_utils.rs:171-179 | datafusion/common/src/hash_utils/build_hasher.rs:67-74 \u2014 before extracting anything, compare \u0060datafusion/common/src/hash_utils.rs\u0060 and \u0060datafusion/common/src/hash_utils/build_hasher.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/hash_utils.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d11c48704d05a38f1dea8f9a6902c8019b148d2671fcf21957a8bad23b780ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/common/src/scalar/mod.rs:2012-2019 | datafusion/common/src/scalar/mod.rs:2163-2170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/scalar/mod.rs:2012\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de852417307f906c04390c7c3f4bbbd682781bb9ed79850ad4b346c4cf91433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): datafusion/common/src/scalar/mod.rs:3620-3627 | datafusion/common/src/scalar/mod.rs:3727-3732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/scalar/mod.rs:3620\u0060 it does not close everything it opens, so those exact lines 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":3620}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3b22653823737691be91e1ea7d0dc806a202362a688541b30b4229c46f74f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/core/src/dataframe/mod.rs:1217-1224 | datafusion/core/src/dataframe/mod.rs:1244-1251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/core/src/dataframe/mod.rs:1217\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"defc1389acdbd167ab60560d3f1aa16d801d69772d0387a84dd4005d32b243ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/core/src/dataframe/mod.rs:1226-1233 | datafusion/core/src/dataframe/mod.rs:1235-1242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/core/src/dataframe/mod.rs:1226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a9bdad1b0089d69a9795d1d18f6f2222bfd00f4dab6c3b50b57afe1857ea28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/datasource-parquet/src/schema_coercion.rs:629-636 | datafusion/datasource-parquet/src/schema_coercion.rs:663-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/schema_coercion.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b67694dc58d658b3b6da00599e80cacf38ec66cc0c4d13e7821d6abdbee04cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/expr-common/src/interval_arithmetic.rs:582-589 | datafusion/expr-common/src/interval_arithmetic.rs:607-614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr-common/src/interval_arithmetic.rs:582\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e55f969db79eb08b9c55bb162c22806e48358dde66af6dfe8cb2378b1cfd19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/expr-common/src/interval_arithmetic.rs:2003-2010 | datafusion/expr-common/src/interval_arithmetic.rs:2043-2050 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr-common/src/interval_arithmetic.rs:2003\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea0aaca5e34b6c39e9ed40dd83a10feff985758b2a4fca72226f2efce9f78cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/expr/src/expr.rs:824-831 | datafusion/physical-expr/src/expressions/binary.rs:217-224 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/expr.rs:824\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut std::fmt::Formatter\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":"datafusion/expr/src/expr.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac528f74a6440c8c81e1d071a67864ca7354137e5bb42ea27ef176083313bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/expr/src/expr_schema.rs:405-412 | datafusion/expr/src/expr_schema.rs:576-583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cabfc7dc6d70dcbeb5b1b4f7e55f327d98b68285f0113dd447b0628ccaa90ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/expr/src/logical_plan/invariants.rs:66-73 | datafusion/expr/src/logical_plan/invariants.rs:119-126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/invariants.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":"datafusion/expr/src/logical_plan/invariants.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f9d13a0bbbd4761b7151f2356cb235817050954528bfd69305b7eb4b18fff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:464-471 | datafusion/ffi/src/proto/physical_extension_codec.rs:405-412 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31b07e9aecbf8b53e721072f44a82e63a8f2a535dd7de9a2fcd719d54f67007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:483-490 | datafusion/ffi/src/proto/physical_extension_codec.rs:424-431 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7683cc72ea29398123ffd6d092d150ed3b066c173317a86b58ebbe68c72b1e69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/functions-aggregate/src/approx_distinct.rs:847-854 | datafusion/functions-aggregate/src/approx_distinct.rs:976-983 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/approx_distinct.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da6f42806a3b3ed29b5860229847726a14a354dbb385241d2fb2982a5786fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/functions-nested/src/array_has.rs:976-983 | datafusion/functions-nested/src/array_has.rs:989-996 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_has.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"160352497243fa93c32b738710641d6a24aca4366ebffcc82dae87e027dfb3e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/functions/src/regex/regexpcount.rs:181-188 | datafusion/functions/src/regex/regexpcount.rs:201-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":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e949a4fbcadb501c9c930dfbf7d3c14d71684257c5e82e845201907a20ec588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/functions/src/string/ends_with.rs:117-126 | datafusion/functions/src/string/starts_with.rs:113-122 \u2014 before extracting anything, compare \u0060datafusion/functions/src/string/ends_with.rs\u0060 and \u0060datafusion/functions/src/string/starts_with.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/ends_with.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"15461b5ed3ae0b18d4bfeda36c3007a3fede237e58c8246c72fd933f7d9e878d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/functions/src/string/split_part.rs:364-372 | datafusion/functions/src/unicode/initcap.rs:238-245 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/unicode/initcap.rs:238\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/split_part.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa4c97c0923d662f2fa2d576560d360589c75f7788159a0f454d35eb50e4f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-expr/src/expressions/binary.rs:201-208 | datafusion/physical-expr/src/expressions/binary.rs:948-955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/expressions/binary.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":"datafusion/physical-expr/src/expressions/binary.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"55142429db96673c6a0c038db5ad8fd0438f9579ad8fa22d8953df98d0ee51c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs:303-310 | datafusion/physical-plan/src/aggregates/aggregate_hash_table/common_clustered.rs:435-442 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common_clustered.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs:303\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e85be9b48c8d956a734b5cd7dbafb49e4c626c0306d0276db008a737e26866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs:379-386 | datafusion/physical-plan/src/aggregates/aggregate_hash_table/common_clustered.rs:334-341 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common_clustered.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.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":"datafusion/physical-plan/src/aggregates/aggregate_hash_table/common.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf148a4282c7e511ba2fe8d0f02432121372372a042e56e891455f6a691db38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs:144-151 | datafusion/physical-plan/src/aggregates/hash_stream.rs:212-219 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/physical-plan/src/aggregates/hash_stream.rs:221\u0060 calls \u0060counter\u0060 and \u0060datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs:153\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e463576a8891fed6f05558171216a30faae9d00a6f24177ebcfa7fe82c6f0646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-plan/src/aggregates/group_values/multi_group_by/dictionary.rs:521-529 | datafusion/physical-plan/src/aggregates/group_values/multi_group_by/dictionary.rs:538-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/dictionary.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c62250383f47814d9105de80fe5f268ac0855a1d00848b9ec35aaa9dd924376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): datafusion/physical-plan/src/joins/hash_join/exec.rs:2321-2328 | datafusion/physical-plan/src/joins/nested_loop_join.rs:1025-1031 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 and \u0060datafusion/physical-plan/src/joins/nested_loop_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs:2321\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b535c857d9fa6b48af05d7bd2f8787abb53a6ae8e7e7650d62ebcc38178e558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1366-1373 | datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1421-1428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1366\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the 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, \u0060datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1375\u0060 calls \u0060Ok\u0060 and \u0060datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1430\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":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df3f36a59c1c35b06b585790ea02a591f8ee3d9ee1560b3ae8f95a6ffc2605f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-plan/src/repartition/range.rs:397-404 | datafusion/physical-plan/src/repartition/range.rs:453-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 \u0060datafusion/physical-plan/src/repartition/range.rs:397\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/repartition/range.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fba5fecc51700bedb3b58a31e0f1d8ef62e305d83c1c1d1fb6f7f61d1e7b425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/proto-common/gen/src/main.rs:18-25 | datafusion/proto-models/gen/src/main.rs:20-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/proto-common/gen/src/main.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":"datafusion/proto-common/gen/src/main.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9c119008d148b342a0f85a88535f309bb267863162333c6716fc4eba13c3e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/sql/src/expr/mod.rs:1158-1165 | datafusion/sql/src/expr/mod.rs:1189-1196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/expr/mod.rs:1158\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/mod.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7dd55725f86abc8249d40470ceabb17b69ac6e0b9f67978d58b3585236cfa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/sql/src/unparser/expr.rs:457-464 | datafusion/sql/src/unparser/expr.rs:472-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1657c7d351b4e89c9812f7fc22d23bf00a52fd909170efc6b32bc3d3eb12211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/substrait/src/logical_plan/producer/expr/literal.rs:277-284 | datafusion/substrait/src/logical_plan/producer/expr/literal.rs:285-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/producer/expr/literal.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30ad6b1c5c5acf9b23243fb68c875b3ecbc5cbca06c20f9428223ac93c57bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 12): datafusion/physical-plan/src/aggregates/mod.rs:2170-2176 | datafusion/physical-plan/src/async_func.rs:166-172 | datafusion/physical-plan/src/buffer.rs:165-171 | datafusion/physical-plan/src/coalesce_batches.rs:174-180 | datafusion/physical-plan/src/coalesce_partitions.rs:155-161 | datafusion/physical-plan/src/filter.rs:698-704 | datafusion/physical-plan/src/limit.rs:192-198 | datafusion/physical-plan/src/limit.rs:482-488 | datafusion/physical-plan/src/sorts/sort_preserving_merge.rs:279-285 | datafusion/physical-plan/src/unnest.rs:232-238 | datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:466-472 | datafusion/physical-plan/src/windows/window_agg_exec.rs:257-263 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs\u0060 and \u0060datafusion/physical-plan/src/windows/window_agg_exec.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/mod.rs:2170\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54cbb0a74ac3b89aa57cfe33cfc8adfb946b7602962eee5b1711e1a8f9c7da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): datafusion/functions-nested/src/utils.rs:227-233 | datafusion/functions/src/regex/regexpcount.rs:92-98 | datafusion/functions/src/regex/regexpinstr.rs:110-116 | datafusion/functions/src/regex/regexpmatch.rs:110-116 | datafusion/functions/src/regex/regexpreplace.rs:198-204 | datafusion/functions/src/utils.rs:111-117 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/utils.rs\u0060 and \u0060datafusion/functions/src/utils.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 \u0060datafusion/functions-nested/src/utils.rs:227\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/utils.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa6938e226cdb9888acc23f57f5caf10f6144c254cc2ebe74b24b39cc703f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:203-209 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:283-289 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:376-382 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:470-476 \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 \u0060datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:203\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"889eccef8157e2c044ec6d4df9b74e176715a1a8914aef3f3a45b4c975f1043e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): datafusion/physical-plan/src/joins/asof_join.rs:499-505 | datafusion/physical-plan/src/joins/asof_join.rs:548-554 | datafusion/physical-plan/src/joins/hash_join/exec.rs:1820-1826 | datafusion/physical-plan/src/joins/nested_loop_join.rs:683-689 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/asof_join.rs\u0060 and \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"8249a462746484b309113f4e0dad5d718741942c1ca610815f3463ef460816f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): datafusion/datasource-avro/src/source.rs:135-141 | datafusion/datasource-csv/src/source.rs:640-646 | datafusion/datasource-json/src/source.rs:240-246 \u2014 before extracting anything, compare \u0060datafusion/datasource-csv/src/source.rs\u0060 and \u0060datafusion/datasource-json/src/source.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-avro/src/source.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5654d2e7bfd557e4b5c3d0c1235ccdb1bc75bc0dc46532babe5830b7096131"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): datafusion/functions-aggregate/src/first_last.rs:326-332 | datafusion/functions-aggregate/src/first_last.rs:1653-1659 | datafusion/functions-aggregate/src/nth_value.rs:146-152 \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":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9b7ef7905cefc1716c8f684ad151c98e7439ae86fd0c6a7875209adf43f857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): datafusion/functions-nested/src/arrays_zip.rs:172-178 | datafusion/functions-nested/src/arrays_zip.rs:184-190 | datafusion/functions-nested/src/arrays_zip.rs:195-201 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"datafusion/functions-nested/src/arrays_zip.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfc3661a70cde82d5b670b0c5ffdf9fbc4603a335f4d463b9731ad7ddca4070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 5): datafusion/functions/src/datetime/date_trunc.rs:954-957 | datafusion/functions/src/datetime/date_trunc.rs:958-964 | datafusion/functions/src/datetime/date_trunc.rs:966-972 | datafusion/functions/src/datetime/date_trunc.rs:974-980 | datafusion/functions/src/datetime/date_trunc.rs:981-984 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/date_trunc.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c8c80e635a151f73a53c91e9811bba852485b45b595d4cd2a30813cf636209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion-cli/src/object_storage/instrumented.rs:174-180 | datafusion-cli/src/object_storage/instrumented.rs:197-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 \u0060datafusion-cli/src/object_storage/instrumented.rs:174\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion-cli/src/object_storage/instrumented.rs:181\u0060 calls \u0060Some\u0060 and \u0060datafusion-cli/src/object_storage/instrumented.rs:204\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":"datafusion-cli/src/object_storage/instrumented.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a8bc8b24e8c83c8916ea08a6cd467400f75062c6136c7ffe31b666fa01490e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/common/src/dfschema.rs:766-772 | datafusion/common/src/dfschema.rs:835-841 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/dfschema.rs:766\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/dfschema.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4bbfd713efcc8ef9d12030f03513e983893ed8bd3dc484a5e43438092fefad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/common/src/scalar/mod.rs:3419-3426 | datafusion/common/src/scalar/mod.rs:4096-4102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/scalar/mod.rs:3419\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":3419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa068b4690cbfce02b16b513b0665787c7d8463ae64c7edd5713a9eb24c274b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/common/src/stats.rs:894-900 | datafusion/common/src/stats.rs:922-928 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/stats.rs:894\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/stats.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"523d154681a31ac63d5a969e4ef509ed3bb3fec1c0714dd55f72d12cdd48bd9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/datasource/src/display.rs:59-65 | datafusion/datasource/src/display.rs:68-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 \u0060datafusion/datasource/src/display.rs:59\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/display.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0728b4de522af7a5998b71b33e983fe8874782f96e4af37d521c80d14dbeb4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): datafusion/datasource/src/projection.rs:113-118 | datafusion/datasource/src/projection.rs:242-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource/src/projection.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/projection.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e6ccd04213eedd3d2247945271d5a72b37b072f4f0c2f61cb026eeb8cd84bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/expr-common/src/interval_arithmetic.rs:992-998 | datafusion/expr-common/src/interval_arithmetic.rs:1023-1029 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"2effb6538d30eceafe1b47b7ddc1402034a91763d8e53c9db4a6d04860879e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/expr/src/logical_plan/builder.rs:1371-1384 | datafusion/expr/src/logical_plan/builder.rs:1386-1399 \u2014 both copies are in the same file, so extract the block 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":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bedd77d191ba0cae65372c9cad457727cb229d736070901f641edf5c8b86231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/expr/src/logical_plan/plan.rs:1613-1620 | datafusion/expr/src/logical_plan/plan.rs:1692-1698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce027482ca17644d88da045fa6eec541db0b6a4e63c42205ba79afcfff9104e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:446-452 | datafusion/ffi/src/proto/physical_extension_codec.rs:387-393 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4fe30ecf0252447487ea92d983c8dbb6498d9509a017f60b281b57aee75db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/functions-aggregate-common/src/aggregate/count_distinct/groups.rs:102-108 | datafusion/functions-aggregate/src/count.rs:735-741 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/groups.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d71dacfdfb974f4830690a47c186d1624e0e0cbd5c88716410a37edab49873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/functions-aggregate/src/correlation.rs:178-186 | datafusion/functions-aggregate/src/correlation.rs:271-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/correlation.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8e2c895c502fb4baf20c8b450d40f749b60af8f4b7d9b0243a3f266b1c26a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/functions-aggregate/src/first_last.rs:1555-1561 | datafusion/functions-aggregate/src/first_last.rs:1942-1948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4766a17d244bf01aa7a0aa2eb01e445bdc853af0b9a6b9965786cd26d7e3dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/functions-nested/src/extract.rs:643-649 | datafusion/functions-nested/src/extract.rs:730-736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/extract.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05068175ccef14cb99dd0a3bf9ae9741816e36b9256eb070349d675fc0839a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): datafusion/functions-nested/src/flatten.rs:120-126 | datafusion/functions-nested/src/flatten.rs:156-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/flatten.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"58703abe0ea91007f1debba92a6ee02c422265d0560b74c502a7f79551807786"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/functions-nested/src/lib.rs:222-228 | datafusion/functions/src/lib.rs:170-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":"datafusion/functions-nested/src/lib.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7fc97f68c11ad9c6ab566f40b206de7d4efa3e21ce3939be66a221c191f72f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/functions/src/unicode/substr.rs:344-350 | datafusion/functions/src/unicode/substrindex.rs:293-299 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/unicode/substr.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf9341a5d90af26f2eb4b99afd5dbaf12ba2cccedae1a44b8b9597fd348f406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/optimizer/src/eliminate_cross_join.rs:460-467 | datafusion/optimizer/src/eliminate_cross_join.rs:474-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 \u0060datafusion/optimizer/src/eliminate_cross_join.rs:460\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/optimizer/src/eliminate_cross_join.rs:468\u0060 calls \u0060Some\u0060 and \u0060datafusion/optimizer/src/eliminate_cross_join.rs:484\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":"datafusion/optimizer/src/eliminate_cross_join.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"f074f844a180df7fd74e7675583c6fbee48b96063d10b27f6c6e06ab89c9ffe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/optimizer/src/push_down_filter.rs:981-987 | datafusion/optimizer/src/push_down_filter.rs:1085-1091 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/push_down_filter.rs:1085\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"146781ac6988d419298da34c6ba321f10314bbf6cbc12d086b730c4bc32e9ffc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1855-1861 | datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1965-1971 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs:1855\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"90287dfed554c59c3ab7a65843aec2b9d5b8bc98c81c3843ffb411140870e428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/physical-optimizer/src/pushdown_sort.rs:93-99 | datafusion/physical-optimizer/src/pushdown_sort.rs:149-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 \u0060datafusion/physical-optimizer/src/pushdown_sort.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":"datafusion/physical-optimizer/src/pushdown_sort.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"443b44fd328e4f4b2a82bde8d5d4494c6b092ef413440bccc688e5702be92b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/physical-plan/src/aggregates/hash_stream.rs:411-417 | datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs:211-217 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/hash_stream.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/hash_stream.rs:411\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines 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 \u0060hash_table\u0060 to \u0060\u0026mut AggregateHashTable\u003CPartialMarker\u003E\u0060 in one and \u0060\u0026mut AggregateHashTable\u003CPartialReduceMarker\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":"datafusion/physical-plan/src/aggregates/hash_stream.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c16509075c4e9971f1ba2a88a7a586574099550386d1be8b435fd5c2ceed8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/physical-plan/src/analyze.rs:515-521 | datafusion/physical-plan/src/analyze.rs:528-534 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/analyze.rs:515\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/analyze.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a99fc671ca9dab9479c57f318e90a6a10bab4517b8601328da643f45ad2c806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1665-1671 | datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:1789-1795 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad260a82c2a7b3ec7479f9bc14362cdf08d1e3158a3ad92d7ad705b2dedae140"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/physical-plan/src/joins/utils.rs:1303-1310 | datafusion/physical-plan/src/joins/utils.rs:1321-1327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/utils.rs:1303\u0060 it does not close everything it opens, so those exact lines 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 \u0060crate) fn get(\u0026mut\u0060 in one and \u0060crate) fn get_shared(\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":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d37596a7bb7d458a01ac164a30eb3c29cc05a83469643ca7f3edfa14d1bdcd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-plan/src/topk/mod.rs:1900-1907 | datafusion/physical-plan/src/topk/mod.rs:2886-2893 \u2014 both copies are in the same file, so extract the block 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 \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060crate) fn insert_batch(\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":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":1900}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fee6740e71c031bea4007a347d0f177d504f731807bda99235918f6beeaa844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-plan/src/topk/mod.rs:1909-1916 | datafusion/physical-plan/src/topk/mod.rs:2914-2921 \u2014 both copies are in the same file, so extract the block 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 \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060crate) fn insert_batch(\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":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4bd10e7943cf693256a2f67e761836a6a726958727a772fafdece08a56eb6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:387-393 | datafusion/physical-plan/src/windows/window_agg_exec.rs:178-184 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs\u0060 and \u0060datafusion/physical-plan/src/windows/window_agg_exec.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:387\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01f8f4a8dcc5570cd9f4c80ce098a09413c2da1503293d9714bab65de69096c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/sql/src/unparser/expr.rs:318-324 | datafusion/sql/src/unparser/expr.rs:427-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/unparser/expr.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":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"994b90e106d36cda9de1740a7d5429f70e49dc14d54b6c2a53fc464761745d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): datafusion/functions-nested/src/utils.rs:226-231 | datafusion/functions/src/regex/regexpcount.rs:91-96 | datafusion/functions/src/regex/regexpinstr.rs:109-114 | datafusion/functions/src/regex/regexpmatch.rs:109-114 | datafusion/functions/src/regex/regexpreplace.rs:197-202 | datafusion/functions/src/regex/regexpreplace.rs:691-696 | datafusion/functions/src/utils.rs:110-115 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/utils.rs\u0060 and \u0060datafusion/functions/src/utils.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060args\u0060 to \u0060\u0026[\u0026ArrayRef]\u0060 in one and \u0060ScalarFunctionArgs\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":"datafusion/functions-nested/src/utils.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"143bd20d86e61a474a755f09208c72dbbfc004dab92682e93552e25bedd6e81d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): datafusion/functions/src/math/abs.rs:164-169 | datafusion/functions/src/math/monotonicity.rs:332-338 | datafusion/functions/src/math/monotonicity.rs:435-441 | datafusion/functions/src/math/monotonicity.rs:473-479 | datafusion/functions/src/math/monotonicity.rs:511-517 | datafusion/functions/src/math/monotonicity.rs:638-644 \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":"datafusion/functions/src/math/abs.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b59352600c64b6e8a1c4952eb469147242d07e15a5485c1f77c237ba7fd0c94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): datafusion/functions-aggregate/src/covariance.rs:282-287 | datafusion/functions-aggregate/src/covariance.rs:307-312 | datafusion/functions-aggregate/src/regr.rs:610-616 | datafusion/functions-aggregate/src/regr.rs:640-646 \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":"datafusion/functions-aggregate/src/covariance.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b82978d0039769d8f2f1caae65baf2ff9769845abafd1be9fd01f3408ccbe17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): datafusion/execution/src/disk_manager.rs:108-113 | datafusion/execution/src/disk_manager.rs:120-125 | datafusion/execution/src/disk_manager.rs:129-134 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/execution/src/disk_manager.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":"datafusion/execution/src/disk_manager.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93ebbbc690db5e654bafe9e5c7b44f5335884befc7f0b2e8c44abf3b6a4a7fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): datafusion/functions/src/string/btrim.rs:23-29 | datafusion/functions/src/string/ltrim.rs:24-30 | datafusion/functions/src/string/rtrim.rs:24-30 \u2014 before extracting anything, compare \u0060datafusion/functions/src/string/ltrim.rs\u0060 and \u0060datafusion/functions/src/string/rtrim.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/string/btrim.rs:23\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/btrim.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a0c52738527d28b8951cea4c9bfca3e2e0061996b70fcd842fcf14ad927b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): datafusion/functions/src/unicode/find_in_set.rs:269-274 | datafusion/functions/src/unicode/find_in_set.rs:297-302 | datafusion/functions/src/unicode/find_in_set.rs:347-352 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"datafusion/functions/src/unicode/find_in_set.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cefb061274fcf0e7cc22482c32aef11413309a05adf786ff8bd357b1ca149e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs:144-149 | datafusion/physical-plan/src/aggregates/hash_stream.rs:212-217 | datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs:104-109 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/hash_stream.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/physical-plan/src/aggregates/hash_stream.rs:218\u0060 calls \u0060with_type\u0060, \u0060ratio_metrics\u0060 and \u0060datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs:109\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":"datafusion/physical-plan/src/aggregates/clustered_partial_stream.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdd67ade7e9441e0d94f76608da61cbce7b2202c96151d97d206777b89e5231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): datafusion/common/src/stats.rs:88-99 | datafusion/common/src/stats.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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/stats.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd95ecd09c440f6267e99d4202b4b09895a675402b34303ac73d8c98b5cac0d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/datasource-arrow/src/source.rs:79-84 | datafusion/datasource-arrow/src/source.rs:121-126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-arrow/src/source.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":"datafusion/datasource-arrow/src/source.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0e3d5eb7515d6c5d6e8f0f5a4adc08cb4d0ed65770c9095c3d2d485f579a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/datasource/src/file_scan_config/mod.rs:790-796 | datafusion/datasource/src/file_scan_config/mod.rs:1622-1627 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource/src/file_scan_config/mod.rs:790\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/file_scan_config/mod.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"093802854871583a3f10397ba3456f6d6885250484d88b11150ca83585deb60c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/expr-common/src/type_coercion/binary.rs:2005-2010 | datafusion/expr-common/src/type_coercion/binary.rs:2011-2016 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"2496ff845421c88cc7c9e03bb4143520ac439ebe7527faa95eb3c4ebc0cf89ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/expr/src/logical_plan/information_schema.rs:80-85 | datafusion/expr/src/logical_plan/information_schema.rs:150-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/information_schema.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":"datafusion/expr/src/logical_plan/information_schema.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a49a376da16277ff416d6252f19135c5bfc5a11336b1551991fa508dc7e40e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/expr/src/logical_plan/information_schema.rs:722-727 | datafusion/expr/src/logical_plan/information_schema.rs:834-839 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/logical_plan/information_schema.rs:722\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/information_schema.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fefbd0a98822923e293afbf0a3d06a6544242b879813ed37d1dbac7c5c2e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/functions-aggregate/src/correlation.rs:421-426 | datafusion/functions-aggregate/src/correlation.rs:575-580 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/correlation.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"00662a016dd63c2f949017b68446a20f6a05cf5895e6eb49e92dbca61580019b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/functions-aggregate/src/correlation.rs:492-497 | datafusion/functions-aggregate/src/correlation.rs:540-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/correlation.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff006516c1397514c631cbd155baa565eda317d102f3a23eb29a251f8f15a1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/functions-nested/src/array_any_match.rs:146-151 | datafusion/functions-nested/src/array_first.rs:132-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":"datafusion/functions-nested/src/array_any_match.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea991f99f954b26bed5d7a58efad5827501da7708e8e52a95ddddd6ee48bfec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/functions/src/datetime/to_char.rs:215-220 | datafusion/functions/src/datetime/to_char.rs:277-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/to_char.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1646f6416dfc7ecc03b69909eede07102115d0497a6da68cb9eb4e7ac8988f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/functions/src/regex/regexpcount.rs:58-63 | datafusion/functions/src/regex/regexpinstr.rs:70-75 \u2014 before extracting anything, compare \u0060datafusion/functions/src/regex/regexpcount.rs\u0060 and \u0060datafusion/functions/src/regex/regexpinstr.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae4ea6b2e44e55a3637c995a218db3a8700ab90f7c74b3b582fcdbffccd74f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/functions/src/string/ends_with.rs:128-135 | datafusion/functions/src/string/starts_with.rs:124-131 \u2014 before extracting anything, compare \u0060datafusion/functions/src/string/ends_with.rs\u0060 and \u0060datafusion/functions/src/string/starts_with.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/ends_with.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d331fae076b873d3e550b7efb19b917e8e939d628bfb82bbea089bed307690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/functions/src/string/ends_with.rs:137-142 | datafusion/functions/src/string/starts_with.rs:133-138 \u2014 before extracting anything, compare \u0060datafusion/functions/src/string/ends_with.rs\u0060 and \u0060datafusion/functions/src/string/starts_with.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/ends_with.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59a9676d348f365aa7d363c7f53fc25915115dde3a39e6b155e92b362caf5af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/functions/src/string/replace.rs:80-86 | datafusion/functions/src/string/replace.rs:102-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/replace.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"83041084361bb926060f5f5b47855c77fe6b5d829b779f79d3697ca984ac344d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-expr-common/src/metrics/value.rs:274-282 | datafusion/physical-expr-common/src/metrics/value.rs:286-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/metrics/value.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef32fafc10c5d3af2d7441721628dbed027d80c30d908010996ad61d1b69fb2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/physical-plan/src/aggregates/group_values/row.rs:355-360 | datafusion/physical-plan/src/aggregates/group_values/row.rs:365-370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/group_values/row.rs:355\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/row.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f5501ba664f80ed845b445f7bdeeb4d5dc2307741170d1347e3229c6b5185f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/physical-plan/src/aggregates/group_values/row.rs:381-386 | datafusion/physical-plan/src/aggregates/group_values/row.rs:392-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 \u0060datafusion/physical-plan/src/aggregates/group_values/row.rs:381\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/row.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce3d5814e53abc0ad2b7209aff1be271a1f07ae45daa40a3a4297c5a368ba7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs:498-504 | datafusion/physical-plan/src/aggregates/spill.rs:182-187 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs:498\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"30739d38e8185ed73422118767b691b2ff8ec90a89436529438456294ca04a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/proto/src/physical_plan/from_proto.rs:294-301 | datafusion/proto/src/physical_plan/from_proto.rs:328-333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/proto/src/physical_plan/from_proto.rs:294\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/physical_plan/from_proto.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d20c5c48c87999107b4c4a73b9ac2ba08c1e6e185a63afc4fb6f7f2dd60c5dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/substrait/src/logical_plan/producer/expr/aggregate_function.rs:37-42 | datafusion/substrait/src/logical_plan/producer/expr/window_function.rs:52-59 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/substrait/src/logical_plan/producer/expr/aggregate_function.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b3f699cc8f46717dda8fc769527bd8cc753cb6224e5a9e2ce173a04de3b82b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): datafusion/functions-nested/src/array_avg.rs:91-95 | datafusion/functions-nested/src/array_normalize.rs:97-101 | datafusion/functions-nested/src/array_product.rs:95-99 | datafusion/functions-nested/src/array_scale.rs:108-116 | datafusion/functions-nested/src/array_sum.rs:91-95 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/array_avg.rs\u0060 and \u0060datafusion/functions-nested/src/array_normalize.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_avg.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22b2fa8f7ece952c8f90f1dc1ccd329e4ef59242ab9d707356daa9936087a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): datafusion/common/src/stats.rs:135-139 | datafusion/common/src/stats.rs:153-157 | datafusion/common/src/stats.rs:171-175 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/stats.rs:135\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/stats.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a11948beaf068b4f44c7f2cc953959059e02bf657a2e23be518108d75e6814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): datafusion/functions-aggregate/src/variance.rs:609-613 | datafusion/functions-aggregate/src/variance.rs:643-647 | datafusion/functions-aggregate/src/variance.rs:669-673 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions-aggregate/src/variance.rs:609\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/variance.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"155bdd520440528c56db56b9bda3f15124cade8354c8b4c06bc3f1d00e211d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): datafusion/physical-plan/src/joins/asof_join.rs:732-736 | datafusion/physical-plan/src/joins/nested_loop_join.rs:1027-1031 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:1024-1028 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/asof_join.rs\u0060 and \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"1398e368c4a73b31a8123a4ba6f6e0b476238b637bd6098d9a8ac081792e029a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion-cli/src/functions.rs:719-723 | datafusion-cli/src/functions.rs:846-850 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion-cli/src/functions.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"41290385c8a2f2b9497fc4df0dc05c6428be50ff6d84873f12afbdc56e83ee6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/common/src/dfschema.rs:741-747 | datafusion/common/src/dfschema.rs:810-816 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/dfschema.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":"datafusion/common/src/dfschema.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fd5c43b2ede73b25ea671b17c2c38a211b5ca576ec04349a28c36b09508e01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/common/src/scalar/mod.rs:4472-4482 | datafusion/common/src/scalar/mod.rs:5010-5020 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4ae5c2f7d5e8f9724ed2ad6007ae4b00ac773238fe124c576dc2df4e9d0f72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/datasource-csv/src/source.rs:940-944 | datafusion/datasource-json/src/source.rs:610-615 \u2014 before extracting anything, compare \u0060datafusion/datasource-csv/src/source.rs\u0060 and \u0060datafusion/datasource-json/src/source.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/datasource-csv/src/source.rs:940\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-csv/src/source.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60d178f7be9d592d3eedcb2b36e0e1690134587f9fab5dd4bc3c7d3c334b78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/datasource/src/memory.rs:731-735 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:1024-1028 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/datasource/src/memory.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"e490f75e4fc1f84d7ce1ef0a8d02b8e868e36fa8fdf1e487ea91e0165389c5f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/execution/src/disk_manager.rs:127-131 | datafusion/execution/src/disk_manager.rs:136-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":"datafusion/execution/src/disk_manager.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"311e4c77501d22ebc10b8cff01ce19392209c7ee30d14adde6dea369b52904bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/expr-common/src/type_coercion/binary.rs:1217-1223 | datafusion/expr-common/src/type_coercion/binary.rs:1225-1231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"775cb309b3574e5f95d425219ff9213422a92905ae2647f8b897458eac48f369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/expr-common/src/type_coercion/binary.rs:2192-2197 | datafusion/expr-common/src/type_coercion/binary.rs:2198-2203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"179da6800ae05bc5e783f92598caf5b2e0e58a80f8722409a1d4c4abb4e4c38d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:437-443 | datafusion/ffi/src/proto/physical_extension_codec.rs:378-384 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b536e0c216a968932afa74a0d3f2c8a3f523bf05f896c095cc844fa55694054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:455-461 | datafusion/ffi/src/proto/physical_extension_codec.rs:396-402 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a43295d3b473cb2a789a87d76938d3c409de5d9b3b6206e3576cb57450e7044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:474-480 | datafusion/ffi/src/proto/physical_extension_codec.rs:415-421 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"318b14698a3172d75468cddd6150c55867c300f627326fae72686d1d58102b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/ffi/src/udf/mod.rs:286-290 | datafusion/ffi/src/udwf/mod.rs:215-219 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/ffi/src/udf/mod.rs:286\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060udf\u0060 to \u0060Arc\u003CScalarUDF\u003E\u0060 in one and \u0060Arc\u003CWindowUDF\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":"datafusion/ffi/src/udf/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67ceea22f7f380624cae1d396d3d5781059e413eee3c5fc38099c631a5b6b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:393-397 | datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:487-491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:393\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"195fcae3b7265a1f48a00bb89b5636d9f26ce9bf34da802b75bb05171f801f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/functions-aggregate/src/array_agg.rs:917-921 | datafusion/functions-aggregate/src/array_agg.rs:1333-1337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f6b2ee430e9a73218f2569c16c4a0290bc2a64a75a220d3492dbe5d0686f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/functions-aggregate/src/average.rs:880-887 | datafusion/functions-aggregate/src/average.rs:961-968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ee58d7ee4d01586f2db73fde681d7e3e679169073ccf296fb712210c2bedd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/functions-nested/src/array_has.rs:836-840 | datafusion/functions-nested/src/array_has.rs:951-955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_has.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3f8b5d9c70b56125d9fb6f7d1e92707fa7fb0e243eb9196cf16a921489ff21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/functions-nested/src/array_transform.rs:151-160 | datafusion/functions-nested/src/lambda_utils.rs:189-193 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions-nested/src/lambda_utils.rs:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_transform.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2da1b6fff9c060fd7609afdda88917351124d4241b9789f09053b20d2fe1710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/functions-nested/src/set_ops.rs:119-125 | datafusion/functions-nested/src/set_ops.rs:202-208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/set_ops.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c289354131267e7f897319a788c2e08671d685742003f3f5b90d842a47b457d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/functions/src/datetime/make_date.rs:110-114 | datafusion/functions/src/datetime/make_time.rs:111-115 \u2014 before extracting anything, compare \u0060datafusion/functions/src/datetime/make_date.rs\u0060 and \u0060datafusion/functions/src/datetime/make_time.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/make_date.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"efde5aad9d0dd7607342757f55f5996c591d0da08735cd5873d0620dceb60604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/functions/src/encoding/inner.rs:457-462 | datafusion/functions/src/encoding/inner.rs:489-493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/functions/src/encoding/inner.rs:457\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/encoding/inner.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cdab3d244f794501ce7283b25a860cf0f486d9eaa9516985362314716e23d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/optimizer/src/push_down_limit.rs:78-83 | datafusion/optimizer/src/push_down_limit.rs:87-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. 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":"datafusion/optimizer/src/push_down_limit.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40d6268d98a3843beeb7ea9e1aa126f1e1186a1bb279ce559e5aa255d9985e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/physical-expr-common/src/physical_expr.rs:268-272 | datafusion/physical-expr-common/src/physical_expr.rs:325-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/physical_expr.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb90bc59912e446d18f03a52d5a8604b8c816ed5da1a7df67c20bb76298153e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/physical-plan/src/display.rs:1257-1268 | datafusion/physical-plan/src/display.rs:1324-1328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/display.rs:1257\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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, \u0060datafusion/physical-plan/src/display.rs:1271\u0060 calls \u0060repeat\u0060 and \u0060datafusion/physical-plan/src/display.rs:1329\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":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bb574b88ae18f320c1140d82406139004dcb56b971f8cbd043cd5c23b14660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): datafusion/datasource/src/memory.rs:296-298 | datafusion/physical-plan/src/joins/hash_join/exec.rs:2210-2221 | datafusion/physical-plan/src/joins/nested_loop_join.rs:974-978 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 and \u0060datafusion/physical-plan/src/joins/nested_loop_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs:2210\u0060 it does not close everything it opens, so those exact lines 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, \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs:2208\u0060 calls \u0060into\u0060 and \u0060datafusion/physical-plan/src/joins/nested_loop_join.rs:973\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":"datafusion/datasource/src/memory.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94ee78336099608c55675d2aef85c2fbd2f527b2338b2d7817c022834656b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/physical-plan/src/joins/utils.rs:1521-1525 | datafusion/physical-plan/src/joins/utils.rs:1529-1533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/utils.rs:1521\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/utils.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da191b623d1a3d256e85c719d7a0919d5a45645dac1ed6c381862171aa895c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/substrait/src/logical_plan/producer/types.rs:262-266 | datafusion/substrait/src/logical_plan/producer/types.rs:273-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/substrait/src/logical_plan/producer/types.rs:262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/producer/types.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c16a22a99bde55b396a4acd2f4e2f23ca3983a669584368aa8ea741f1079df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/catalog-listing/src/table.rs:837-843 | datafusion/catalog/src/cte_worktable.rs:146-152 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/catalog-listing/src/table.rs:837\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog-listing/src/table.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a2a2b7a24bded148997d80707da2bfcde2cb2da3bf37209cf32033c5c29235"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/datasource-parquet/src/metadata.rs:1111-1117 | datafusion/datasource-parquet/src/reader.rs:360-366 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/metadata.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c7b5a335d017d99b0bbefead6981fd90e4b9317107bae3f71b02ac6c52c36e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datafusion/expr-common/src/casts.rs:289-301 | datafusion/physical-plan/src/joins/array_map.rs:104-116 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/casts.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b17794c286c5f36aa7dcefebe6277db34c2c5cf306874616bd974fb3beb4215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/expr-common/src/type_coercion/binary.rs:432-437 | datafusion/physical-expr/src/expressions/binary.rs:241-246 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f4164ee5e79d16ecb6bbde002571b62da8dea31748b714ffcf4207a33fbbd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/expr/src/higher_order_function.rs:832-838 | datafusion/expr/src/udf.rs:885-891 \u2014 before extracting anything, compare \u0060datafusion/expr/src/higher_order_function.rs\u0060 and \u0060datafusion/expr/src/udf.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/higher_order_function.rs:832\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfd793f9469fc0927ac85325231f8ae64c73e670dca9231f8b3ec0f9d8a2fbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): datafusion/expr/src/higher_order_function.rs:1086-1093 | datafusion/expr/src/udaf.rs:1553-1561 | datafusion/expr/src/udf.rs:1133-1140 | datafusion/expr/src/udwf.rs:493-501 \u2014 before extracting anything, compare \u0060datafusion/expr/src/higher_order_function.rs\u0060 and \u0060datafusion/expr/src/udf.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/higher_order_function.rs:1086\u0060 it begins part-way through the construct above it, so those exact lines 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 \u0060inner\u0060 to \u0060Arc\u003Cdyn HigherOrderUDFImpl\u003E\u0060 in one and \u0060Arc\u003Cdyn AggregateUDFImpl\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":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e0360c2b58725dfcdb2b23a8a8426cfc122b98d55cb0033a647b6b06245894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): datafusion/ffi/src/catalog_provider.rs:172-180 | datafusion/ffi/src/catalog_provider_list.rs:137-145 | datafusion/ffi/src/schema_provider.rs:180-188 | datafusion/ffi/src/table_provider.rs:485-493 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/catalog_provider.rs\u0060 and \u0060datafusion/ffi/src/catalog_provider_list.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/catalog_provider.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8821e01a628a7c830804a500863668783134b56cd8c5330905986cc5aece7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:184-191 | datafusion/ffi/src/proto/physical_extension_codec.rs:170-177 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/ffi/src/proto/logical_extension_codec.rs:184\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc93c6be7fcaaf3b5e43f178d9ab923a93ceab414fc404fc5b408c74bf13617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:211-217 | datafusion/ffi/src/proto/physical_extension_codec.rs:197-203 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/ffi/src/proto/logical_extension_codec.rs:211\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd9a8cfb3b79ec8695ea91c609776778ef7a7ec24bdcc6cfab0f57d51f47c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:237-243 | datafusion/ffi/src/proto/physical_extension_codec.rs:223-229 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/ffi/src/proto/logical_extension_codec.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":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee048ee4259017d194a7bbc2ea339f22d2c06465112889866ed18ed11ca702b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/ffi/src/udf/mod.rs:492-498 | datafusion/ffi/src/udwf/mod.rs:310-316 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/ffi/src/udf/mod.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"251837f2149d07e6add00f078268f0cad9c4e672df47a300ab7c01b89c428a9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs:114-119 | datafusion/functions-aggregate-common/src/utils.rs:248-252 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/functions-aggregate-common/src/aggregate/count_distinct/native.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10535f6488e38abcc89adb3c649032ce07d1ea659679cb586dfbcf4dc1f2e94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): datafusion/functions-aggregate/src/array_agg.rs:158-163 | datafusion/functions-aggregate/src/first_last.rs:377-382 | datafusion/functions-aggregate/src/first_last.rs:1693-1698 \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 \u0060datafusion/functions-aggregate/src/array_agg.rs:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4828627d0106a95ae3f87ffc5c2e15b829c221e3769da821005165b6e8760395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/functions-table/src/generate_series/proto.rs:19-25 | datafusion/proto/src/physical_plan/mod.rs:1161-1167 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/functions-table/src/generate_series/proto.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"26977dbdfb6f708f46506ff5594de9a3dd53095f30691d38d54a91a0d896d765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/functions/src/core/arrow_cast.rs:90-100 | datafusion/functions/src/core/arrow_try_cast.rs:62-72 \u2014 before extracting anything, compare \u0060datafusion/functions/src/core/arrow_cast.rs\u0060 and \u0060datafusion/functions/src/core/arrow_try_cast.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/core/arrow_cast.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"997a94341dbdcc4a45f8abf31c56a05c7ab1a5fbd095050c6e73701be83ffb93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/functions/src/core/greatest.rs:128-133 | datafusion/functions/src/core/least.rs:141-146 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/functions/src/core/greatest.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d065e29ea83dd2af7fbd93d84b2c7ec7e465f82039d6c2799ff0d5e64401e050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/functions/src/math/cot.rs:43-57 | datafusion/functions/src/math/signum.rs:49-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/cot.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4ccc9560b8c9c51a57f2f98b50f57c517a75ddda898b1dddbed0b693f3f825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/functions/src/math/iszero.rs:53-59 | datafusion/functions/src/math/nans.rs:51-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/functions/src/math/iszero.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb502bf8e225cdfa2f6e8299a080247582f7f7156e265c84c05a6e12306fe52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): datafusion/functions/src/string/ascii.rs:54-64 | datafusion/functions/src/string/bit_length.rs:46-56 | datafusion/functions/src/string/lower.rs:44-54 | datafusion/functions/src/string/upper.rs:43-53 | datafusion/functions/src/unicode/initcap.rs:52-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/ascii.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5b935c44cdd6511519cc4121d6ffe252524c53d64bac8cad69cabd22c60a8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): datafusion/functions/src/string/contains.rs:46-56 | datafusion/functions/src/string/ends_with.rs:54-64 | datafusion/functions/src/string/levenshtein.rs:58-68 | datafusion/functions/src/string/starts_with.rs:50-60 \u2014 before extracting anything, compare \u0060datafusion/functions/src/string/ends_with.rs\u0060 and \u0060datafusion/functions/src/string/starts_with.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/contains.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfb41d4d5bbe50e12c65611cc8b34a713cdc4682465d02a0a8982d8efa4d497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/functions/src/string/lower.rs:70-76 | datafusion/functions/src/string/upper.rs:69-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/lower.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1693339ce99ae108d15346cffa487d21dbb0b5f2852680a7d05e3f6139a93344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/physical-expr-common/src/binary_map.rs:67-72 | datafusion/physical-expr-common/src/binary_view_map.rs:44-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/physical-expr-common/src/binary_view_map.rs:53\u0060 calls \u0060take\u0060, \u0060Self\u0060 and \u0060datafusion/physical-expr-common/src/binary_map.rs:77\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":"datafusion/physical-expr-common/src/binary_map.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d494c58e138368e6f259347a49dcc9e920efbf2e7992f1c2be0f757292a8ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-expr-common/src/tree_node.rs:59-67 | datafusion/physical-plan/src/tree_node.rs:71-79 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060plan\u0060 to \u0060Arc\u003Cdyn PhysicalExpr\u003E\u0060 in one and \u0060Arc\u003Cdyn ExecutionPlan\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":"datafusion/physical-expr-common/src/tree_node.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0944d45dc599c918524daa72265edebded72f3d168c4e356b78aff54ea982da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/physical-expr/src/higher_order_function.rs:276-280 | datafusion/physical-expr/src/scalar_function.rs:232-236 \u2014 before extracting anything, compare \u0060datafusion/physical-expr/src/higher_order_function.rs\u0060 and \u0060datafusion/physical-expr/src/scalar_function.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/higher_order_function.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"218c9937f6a04f1399223c262e9af0d9324ff9eab92da3f288d359e5765d1aba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-expr/src/window/aggregate.rs:221-229 | datafusion/physical-expr/src/window/sliding_aggregate.rs:110-118 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/window/aggregate.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4aa81a0509f0cd2164b83b7ec301619b1e9b235044a9d69538e8f3520a897f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): datafusion/physical-plan/src/aggregates/hash_stream.rs:276-280 | datafusion/physical-plan/src/aggregates/hash_stream.rs:600-604 | datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs:146-150 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/hash_stream.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"datafusion/physical-plan/src/aggregates/hash_stream.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4121e4b770e8906e0ec517f27cc8cbef725aa2a078f553636bd29ebbb4bf4f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/aggregates/mod.rs:2264-2272 | datafusion/physical-plan/src/joins/hash_join/exec.rs:1637-1645 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"730890071eea1242b125a593f406ed2b84e6436fe37cb262cef13962f44567d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): datafusion/physical-plan/src/buffer.rs:291-299 | datafusion/physical-plan/src/coalesce_batches.rs:268-276 | datafusion/physical-plan/src/coop.rs:340-348 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/buffer.rs:291\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/buffer.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c9cfe1214b5299e93c7a55577be0892d5199453655ec9dd27b38e93e81d2ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/coalesce_batches.rs:237-245 | datafusion/physical-plan/src/sorts/sort.rs:2032-2041 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/physical-plan/src/coalesce_batches.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":"datafusion/physical-plan/src/coalesce_batches.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"979aad6d9be2e813af2021b83dc4085b125643bb8ced4876b20c51c5c35e021e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/physical-plan/src/empty.rs:53-59 | datafusion/physical-plan/src/placeholder_row.rs:52-58 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/empty.rs\u0060 and \u0060datafusion/physical-plan/src/placeholder_row.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/empty.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"359528f141cf791f4baa97ea00d4e348b6b439e4846fa3114038e42a9271ab3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/empty.rs:70-78 | datafusion/physical-plan/src/placeholder_row.rs:88-96 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/empty.rs\u0060 and \u0060datafusion/physical-plan/src/placeholder_row.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/empty.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e52bc33f5a3f9f24e55454bbf8e9c8cfad50ff420b0f14f709f224c730358d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/physical-plan/src/joins/hash_join/partitioned_hash_eval.rs:700-706 | datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs:2234-2240 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060datafusion/physical-plan/src/joins/hash_join/partitioned_hash_eval.rs:700\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/partitioned_hash_eval.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"a228bd24ec208181416b3fc378cf3c45eba4a35d67cd412a22557f8c7ef3dfe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/physical-plan/src/joins/proto.rs:55-61 | datafusion/proto-common/src/to_proto/mod.rs:817-823 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/physical-plan/src/joins/proto.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3ab88521e633f69431ae494bd85ece2b18a8abd357f4fff8ab32d852ca36e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/physical-plan/src/sorts/partial_sort.rs:353-359 | datafusion/physical-plan/src/sorts/sort.rs:1800-1809 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/physical-plan/src/sorts/partial_sort.rs:361\u0060 calls \u0060benefits_from_input_partitioning\u0060 and \u0060datafusion/physical-plan/src/sorts/sort.rs:1811\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":"datafusion/physical-plan/src/sorts/partial_sort.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"261f814ad1580be2e8299de0c592a77ea89a9491eb08855f83a1195a030bc3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs:263-270 | datafusion/physical-plan/src/windows/window_agg_exec.rs:104-111 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs\u0060 and \u0060datafusion/physical-plan/src/windows/window_agg_exec.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee9532557702a48230cab1d03dabbebc55c9508198c9eaa0737e6ce0f1bef13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/proto-common/src/from_proto/mod.rs:961-969 | datafusion/proto-common/src/to_proto/mod.rs:827-835 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060value\u0060 to \u0060CompressionTypeVariant\u0060 in one and \u0060\u0026CompressionTypeVariant\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":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4a7d61045cf5413ea82bef71fd1c2f79c81d4a19012095763012750d6eaa08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/common/src/types/canonical_extensions/fixed_shape_tensor.rs:35-40 | datafusion/common/src/types/canonical_extensions/variable_shape_tensor.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/types/canonical_extensions/fixed_shape_tensor.rs:35\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060metadata\u0060 to \u0060\u003CFixedShapeTensor as ExtensionType\u003E::Metadata\u0060 in one and \u0060\u003CVariableShapeTensor as ExtensionType\u003E::Metadata\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":"datafusion/common/src/types/canonical_extensions/fixed_shape_tensor.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fee0cbc123fe23f1017faebf0c422aa65225127e94063f2ec5ec74caa3cec95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/datasource-csv/src/file_format.rs:885-894 | datafusion/datasource-json/src/file_format.rs:516-526 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060value\u0060 to \u0060\u0026CsvSink\u0060 in one and \u0060\u0026JsonSink\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":"datafusion/datasource-csv/src/file_format.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50c5d4f3c5521f814867e833ae468b758b6f805b2ffcd45fdb9cba68179cd48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/ffi/src/catalog_provider.rs:96-101 | datafusion/ffi/src/catalog_provider_list.rs:87-92 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/catalog_provider.rs\u0060 and \u0060datafusion/ffi/src/catalog_provider_list.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/ffi/src/catalog_provider.rs:96\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/catalog_provider.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7dca1b715a06f5ca034aa1de5a3b98542a1c67a517f63d62f1e64595eea68c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/ffi/src/catalog_provider.rs:288-295 | datafusion/ffi/src/schema_provider.rs:307-314 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/catalog_provider.rs\u0060 and \u0060datafusion/ffi/src/schema_provider.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"datafusion/ffi/src/catalog_provider.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a91fb09bc83a7354ac3bfb8e3d300fab57a470638774de03d982ed4efd0143f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): datafusion/ffi/src/execution/task_ctx.rs:140-146 | datafusion/ffi/src/execution/task_ctx_provider.rs:97-103 | datafusion/ffi/src/session/mod.rs:361-367 \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":"datafusion/ffi/src/execution/task_ctx.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfa2a3f91cd63e1f208d1975ac0b8f02d18ef270e792287eb52daa595cc3366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:259-268 | datafusion/ffi/src/proto/physical_extension_codec.rs:245-254 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8097c579969bbe5c3a627741dcf7d55148e5bf86419c58dfc649b8bcdf1b71f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/ffi/src/proto/logical_extension_codec.rs:272-277 | datafusion/ffi/src/proto/physical_extension_codec.rs:258-263 \u2014 before extracting anything, compare \u0060datafusion/ffi/src/proto/logical_extension_codec.rs\u0060 and \u0060datafusion/ffi/src/proto/physical_extension_codec.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/ffi/src/proto/logical_extension_codec.rs:272\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/proto/logical_extension_codec.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f994fd11c38ebddf96f5300abc4d209b041c13f70efd9d4d97027b8ff838e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/functions-aggregate/src/average.rs:55-64 | datafusion/functions-aggregate/src/count.rs:64-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45f6c0a68affadfb6c8f243836a068c23e8d1af56e61256582755d8f2d68af0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/physical-expr-common/src/tree_node.rs:51-55 | datafusion/physical-plan/src/tree_node.rs:62-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/tree_node.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa690a9ecf2a407934f5cdd66abceede4247a11721afc04d2601ff643d294d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-expr/src/physical_expr.rs:212-219 | datafusion/proto/src/physical_plan/from_proto.rs:93-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/physical_expr.rs:212\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/physical_expr.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b40870b4359fd1d551456107331806edc7f2d873a470c6ccdf4a7176c89473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/physical-expr/src/proto.rs:212-217 | datafusion/physical-plan/src/proto/registry.rs:183-188 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060node\u0060 to \u0060\u0026PhysicalExprNode\u0060 in one and \u0060\u0026PhysicalPlanNode\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":"datafusion/physical-expr/src/proto.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bce00a5227edecd1ca19d5ada066bfd350a1c56a7d32b7eaff6ae12b46dcbce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): datafusion/physical-plan/src/aggregates/hash_stream.rs:308-325 | datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs:172-189 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/aggregates/hash_stream.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/partial_reduce_stream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/aggregates/hash_stream.rs:308\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/hash_stream.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55e2f69f49bea7e60db272557a797888cabbdf83d5edfdd01d2322a24512bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): datafusion/physical-plan/src/aggregates/clustered_single_stream.rs:187-203 | datafusion/physical-plan/src/aggregates/hash_stream.rs:577-593 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060datafusion/physical-plan/src/aggregates/clustered_single_stream.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":"datafusion/physical-plan/src/aggregates/clustered_single_stream.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"457da066ed7b09ba0687b9b44f7d7fed4dcc3d1692a2375d022af029aea81ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): datafusion/physical-plan/src/aggregates/hash_stream.rs:566-581 | datafusion/physical-plan/src/aggregates/single_stream.rs:177-192 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/physical-plan/src/aggregates/hash_stream.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3508aec4ff9d424ffccd9ab83fc77a72c576c6d821e6d15540ba4a1a7e5a7a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/functions/src/string/split_part.rs:248-262 | datafusion/functions/src/unicode/substrindex.rs:190-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/split_part.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"42aa977db904ac473dbefe4deb91a791a040756cca5f42a2a7645900afb4b8a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/physical-plan/src/empty.rs:204-217 | datafusion/physical-plan/src/placeholder_row.rs:204-217 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/empty.rs\u0060 and \u0060datafusion/physical-plan/src/placeholder_row.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/empty.rs:204\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/empty.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9618b28bb2f518acd45884e8e758524ab35bb238af6ef8e6ad6e411899b936f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): datafusion/functions-aggregate/src/first_last.rs:348-361 | datafusion/functions-aggregate/src/first_last.rs:1675-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8164168ae1d134e06ffb938551bb08bfeb3dfe16521dfae6e0d43fd0f27152a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/physical-plan/src/joins/asof_join.rs:691-701 | datafusion/physical-plan/src/joins/hash_join/exec.rs:2287-2299 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/asof_join.rs\u0060 and \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/asof_join.rs:691\u0060 it begins part-way through the construct above it, so those exact lines 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":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd9a702848afa63775c4f5d55fbf7ba78bc94536e2998433eb83b4630bc797b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/sql/src/parser.rs:1070-1080 | datafusion/sql/src/parser.rs:1149-1161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/parser.rs:1070\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/parser.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"1685cc067a8500c1a0f4085220443d270bc1eaf3e523e0a99e02eb351d792688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:986-998 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:830-840 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.rs\u0060 and \u0060datafusion/physical-plan/src/joins/symmetric_hash_join.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:986\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/exec.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f23be8559a536aec93e92011389ea828643e86943170c5ea402b7b25bd60ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): datafusion/expr-common/src/signature.rs:789-800 | datafusion/expr-common/src/signature.rs:803-814 | datafusion/expr-common/src/signature.rs:817-828 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44a8772b15b259418f484f53f0466f14bd4f3b8771ca2d6d0542c42882c09a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/expr/src/udaf.rs:1269-1280 | datafusion/expr/src/udaf.rs:1458-1466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/expr/src/udaf.rs:1269\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/udaf.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e142dd98b1cd7dd1cc955e6745c2308328161e9b6d1544b228e9dca10702fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): datafusion/sql/src/parser.rs:1070-1081 | datafusion/sql/src/parser.rs:1457-1468 | datafusion/sql/src/parser.rs:1492-1503 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sql/src/parser.rs:1070\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/parser.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1c75c06e38aba1c082c279dc9fe10fc46c96465eb4427b0ef2763556f2bd6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/functions/src/math/cot.rs:102-113 | datafusion/functions/src/math/signum.rs:106-115 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/functions/src/math/cot.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e174d879c2943478f47cebb399952638e04755625fa380f0bd06abd0228978be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/joins/hash_join/exec.rs:1487-1498 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:369-377 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060 and \u0060datafusion/physical-plan/src/joins/symmetric_hash_join.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/hash_join/exec.rs:1487\u0060 it does not close everything it opens, so those exact lines 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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd312c30213bd897a45a6fa5c875721439d361fa3f5a53f6f92de079255425d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/proto/src/logical_plan/from_proto.rs:216-226 | datafusion/proto/src/logical_plan/from_proto.rs:527-537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/from_proto.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df5b1341045415cb288949cb313489b0af13b462b109a919ec2e35e4c35656d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/physical-expr/src/expressions/cast.rs:766-776 | datafusion/physical-expr/src/expressions/try_cast.rs:265-275 \u2014 before extracting anything, compare \u0060datafusion/physical-expr/src/expressions/cast.rs\u0060 and \u0060datafusion/physical-expr/src/expressions/try_cast.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/cast.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"776218e6221d42fbf79b36c8046431189b94abadd61b6629ffb85050ca3bc267"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/common/src/scalar/mod.rs:2042-2052 | datafusion/common/src/scalar/mod.rs:2116-2126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/scalar/mod.rs:2042\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b224446d2741c87a3629732479184c1f241126392c8f8ac8b5f8c5bf7b5d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/common/src/scalar/mod.rs:2028-2038 | datafusion/common/src/scalar/mod.rs:2102-2112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/scalar/mod.rs:2028\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e29b16d872a5b69014a27fca1253a3dbc6412b8f21d2b80837ec8e6c79504b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/common/src/scalar/mod.rs:2015-2025 | datafusion/common/src/scalar/mod.rs:2089-2099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"340e72b957eea6229483824c6809d3f72eb444a82587005a94b9b1a66a071dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/functions/src/regex/regexpcount.rs:122-132 | datafusion/functions/src/regex/regexpinstr.rs:140-150 \u2014 before extracting anything, compare \u0060datafusion/functions/src/regex/regexpcount.rs\u0060 and \u0060datafusion/functions/src/regex/regexpinstr.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexpcount.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab80407c3fbd2592d23f63d6856e0613974d2ecaf9dadd81e38990e1ec669f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/catalog-listing/src/table.rs:1074-1084 | datafusion/catalog-listing/src/table.rs:1154-1164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/catalog-listing/src/table.rs:1074\u0060 it does not close everything it opens, so those exact 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":"datafusion/catalog-listing/src/table.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba241fcf0712b7279a745f7cc728cc5dd10a52abb0fd1af73f6c4f7879e81061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/core/src/execution/context/mod.rs:1371-1378 | datafusion/core/src/execution/context/mod.rs:1419-1429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/core/src/execution/context/mod.rs:1371\u0060 it begins part-way through the construct above it, so those exact lines 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":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1f1b748225a1372b13ddb281fe1bf6d20e182facaf4f4030a6abc5cddaaddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): datafusion/functions-nested/src/array_avg.rs:85-89 | datafusion/functions-nested/src/array_normalize.rs:91-95 | datafusion/functions-nested/src/array_product.rs:89-93 | datafusion/functions-nested/src/array_scale.rs:93-103 | datafusion/functions-nested/src/array_sum.rs:85-89 \u2014 before extracting anything, compare \u0060datafusion/functions-nested/src/array_avg.rs\u0060 and \u0060datafusion/functions-nested/src/array_normalize.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_avg.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4a5afdf8b44da80569b1af49d005ca4493734a3a12d633ad982249cb2e7ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): datafusion/functions-aggregate/src/correlation.rs:112-122 | datafusion/functions-aggregate/src/covariance.rs:96-106 | datafusion/functions-aggregate/src/covariance.rs:186-196 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/functions-aggregate/src/correlation.rs:140\u0060 calls \u0060corr\u0060 and \u0060datafusion/functions-aggregate/src/covariance.rs:124\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":"datafusion/functions-aggregate/src/correlation.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0aac252bbac79bf514d73726d24fcf50318afab417ad5ca215341e8803708e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): datafusion/expr/src/sql.rs:41-51 | datafusion/expr/src/sql.rs:116-126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/sql.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"299c180a7c8961ba221cfa02cd63338e461547b42cecae7e0bb33e2a48713930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/physical-expr/src/expressions/in_list/primitive_filter.rs:303-310 | datafusion/physical-expr/src/expressions/in_list/primitive_filter.rs:423-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-expr/src/expressions/in_list/primitive_filter.rs:303\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/in_list/primitive_filter.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"25eccd8a15a38265de44de6c5e21a4784badf054f7fcc6d2d11af5dac0baac8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): datafusion/macros/src/user_doc.rs:126-140 | datafusion/macros/src/user_doc.rs:142-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/macros/src/user_doc.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d277d11924e454bf76e7921097d5e8b8dcbf4e753bf696697026a937ce34234"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/core/src/physical_planner.rs:1081-1088 | datafusion/core/src/physical_planner.rs:1115-1124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/core/src/physical_planner.rs:1081\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the 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, \u0060datafusion/core/src/physical_planner.rs:1127\u0060 calls \u0060extract_update_assignments\u0060 and \u0060datafusion/core/src/physical_planner.rs:1090\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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe92dde6f657f9e3d2fdd8ef08bac619f1198264f232296c53a8861a8bd2d2ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/functions-nested/src/array_filter.rs:120-129 | datafusion/functions-nested/src/array_transform.rs:163-172 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_filter.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b347e2834232d62fe11dfe69f5be4c3351c73fd8f1fb1dba769429ba9cd158"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/expr-common/src/type_coercion/binary.rs:328-337 | datafusion/expr-common/src/type_coercion/binary.rs:354-363 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"854e1ebd1b63b5749c83e6cbfffeb52df9fd3a88759689aa7b7ce2c54f03d3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): datafusion/proto-common/src/from_proto/mod.rs:633-642 | datafusion/proto-common/src/from_proto/mod.rs:655-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/proto-common/src/from_proto/mod.rs:633\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"71822845d125cc91693e689027455a49b655215421c53053ebe4fc9dc5f46d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): datafusion/physical-plan/src/joins/asof_join.rs:682-690 | datafusion/physical-plan/src/joins/sort_merge_join/exec.rs:977-985 | datafusion/physical-plan/src/joins/symmetric_hash_join.rs:820-829 \u2014 before extracting anything, compare \u0060datafusion/physical-plan/src/joins/asof_join.rs\u0060 and \u0060datafusion/physical-plan/src/joins/sort_merge_join/exec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/joins/asof_join.rs:682\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/asof_join.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd614b9078a1b59e938c4620eb589e5baabfd501f928623a8bd5106a9d1a0aeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/optimizer/src/scalar_subquery_to_join.rs:102-111 | datafusion/optimizer/src/scalar_subquery_to_join.rs:172-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/optimizer/src/scalar_subquery_to_join.rs:102\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/scalar_subquery_to_join.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3148d4893fc69898bbaa842576b3c5cad94a3fa21316ce6f24347021c22a7ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/substrait/src/logical_plan/consumer/expr/literal.rs:443-451 | datafusion/substrait/src/logical_plan/consumer/expr/literal.rs:541-549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/substrait/src/logical_plan/consumer/expr/literal.rs:443\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/substrait/src/logical_plan/consumer/expr/literal.rs:452\u0060 calls \u0060from_le_bytes\u0060, \u0060try_into\u0060, \u0060unwrap\u0060 and \u0060datafusion/substrait/src/logical_plan/consumer/expr/literal.rs:550\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":"datafusion/substrait/src/logical_plan/consumer/expr/literal.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2e6f06c993a1dec93cfe152ff434caae4431185220547a1536d5e1c1829008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/datasource-csv/src/file_format.rs:403-411 | datafusion/datasource-parquet/src/file_format.rs:510-518 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/datasource-csv/src/file_format.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0f5e0acb36459a499b08a3c1450add9124252888479e485afa557433646fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/common/src/config.rs:3745-3752 | datafusion/common/src/config.rs:3908-3916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/config.rs:3745\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/config.rs"},"region":{"startLine":3745}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e5ebd0c7a3bb195e5c7f5e5afb3d6c6c371b4c527ffa30057554957dea530b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): datafusion/catalog/src/information_schema.rs:649-656 | datafusion/catalog/src/information_schema.rs:669-676 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/catalog/src/information_schema.rs:649\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af88f7213b704c2d43a9df15fc4dc11628a7b34427e12425ca27f506aeab7e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): datafusion/functions-nested/src/string.rs:511-518 | datafusion/functions-nested/src/string.rs:523-531 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/string.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87bc2cf8989cbe606f29fd6f0d6f0f5dbe27cc94ffc28f039395a514f3cc699"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): datafusion/functions/src/core/greatest.rs:96-102 | datafusion/functions/src/core/least.rs:109-115 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"datafusion/functions/src/core/greatest.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b35653a82978ea5965eae63e8c72f027c2de7ff211b8746d4363089ae0b89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/functions-nested/src/map_entries.rs:108-114 | datafusion/functions-nested/src/map_keys.rs:98-103 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/map_entries.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d0ae7b6d62a91fc3068135a47b3af0b2de5d5b4544a0b07d8628698373e132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): datafusion/substrait/src/logical_plan/consumer/expr/literal.rs:523-528 | datafusion/substrait/src/logical_plan/consumer/expr/literal.rs:538-543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/substrait/src/logical_plan/consumer/expr/literal.rs:523\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/expr/literal.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dbfdea03493d7d2bfe2328ef4d62f4bef2386e183e4feebf846059160e9e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/functions-nested/src/array_add.rs:107-111 | datafusion/functions-nested/src/array_subtract.rs:106-110 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/array_add.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1180b474523b2815d1f82c8103db079accabaaca1f1aec123b781d628f083c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): datafusion/common/src/scalar/mod.rs:1761-1768 | datafusion/common/src/scalar/mod.rs:2003-2010 | datafusion/common/src/scalar/mod.rs:2154-2161 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"b709d463a41e79c0d4fd99313e701da7fea293a931773cb5885c091814825311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/common/src/stats.rs:228-232 | datafusion/common/src/stats.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/common/src/stats.rs:228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/stats.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09f80dbc3b9d4418ead515ef7112c1f642ea264f40c29d700e83521ef4e7316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/expr-common/src/type_coercion/binary.rs:2205-2209 | datafusion/expr-common/src/type_coercion/binary.rs:2211-2215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"02de482443fed2f9701b89338f16268f034a6920123a02555b306c393a616947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/expr/src/expr_schema.rs:647-651 | datafusion/expr/src/expr_schema.rs:655-659 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db5219b98cbd552a46573f3a9abcea8fe1f44523d7d19768bdeaa97c4eccadd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/functions-aggregate/src/average.rs:1142-1146 | datafusion/functions-aggregate/src/average.rs:1166-1170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"510b43d186ff4de0ca62ce170fa80041f2a527df193046563e26d1f008c0d5fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): datafusion/physical-expr/src/simplifier/not.rs:90-94 | datafusion/physical-expr/src/simplifier/not.rs:100-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060datafusion/physical-expr/src/simplifier/not.rs:87\u0060 calls \u0060op\u0060 and \u0060datafusion/physical-expr/src/simplifier/not.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":"datafusion/physical-expr/src/simplifier/not.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ae706f0a6687953b7c21f92b42036d1683b1f79ddfd0e8b245c159b2749f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): datafusion/physical-plan/src/test.rs:315-356 | datafusion/physical-plan/src/test.rs:362-402 \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":"datafusion/physical-plan/src/test.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fe2d0cc0f515efd645d5f11931721c3e21eb1d53cd88edfe974eb7fb4ce940"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): datafusion/physical-expr/src/intervals/test_utils.rs:28-49 | datafusion/physical-expr/src/intervals/test_utils.rs:67-89 \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":"datafusion/physical-expr/src/intervals/test_utils.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6620dcdc5ec6794ab5ddec1601a8ed0cfa5b7fc51473f1db245893c1415c48d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): datafusion/sqllogictest/src/test_context/range_partitioning.rs:272-303 | datafusion/sqllogictest/src/test_context/range_partitioning.rs:308-345 \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":"datafusion/sqllogictest/src/test_context/range_partitioning.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"454dee9139b5ad205f327a378fbf376a9fd65c00484f56b89ab54d92757e7a79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): test-utils/src/array_gen/string.rs:29-51 | test-utils/src/array_gen/string.rs:54-75 \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":"test-utils/src/array_gen/string.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b523b8a7733bef59c5bd746f45cda422ee00312856cd975fd175fa130c9fee3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): datafusion/physical-plan/src/test.rs:447-463 | datafusion/physical-plan/src/test.rs:469-483 \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":"datafusion/physical-plan/src/test.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d62a4c6d07e0a962e7b94d9614f7d0503d65679c59bd11421a479bd2b7b199"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): datafusion/physical-plan/src/test.rs:497-506 | datafusion/physical-plan/src/test.rs:508-521 \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":"datafusion/physical-plan/src/test.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"715ddd31cc078ef1b26c0ea0aac129f8fd4016b56fda8f8f77ee2e41173c0aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): datafusion/physical-plan/src/test.rs:533-540 | datafusion/physical-plan/src/test.rs:542-551 \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":"datafusion/physical-plan/src/test.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"f627069eeb8c67fb5598e1a154f344144c6c8246f85f233ebcae8b6a615168b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): test-utils/src/array_gen/binary.rs:29-36 | test-utils/src/array_gen/binary.rs:52-59 \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":"test-utils/src/array_gen/binary.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"146ff716adbec67a044b14fa83e9c55addfa00877bca2981f181df5681719e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): test-utils/src/tpcds.rs:604-612 | test-utils/src/tpch.rs:125-133 \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":"test-utils/src/tpcds.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2c7d6b53ce467e32451e686fded6eccd979188483e9ccb0d2e5ba7bf9fc7df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): datafusion/physical-expr/src/proto_test_util.rs:22-32 | datafusion/physical-plan/src/proto_test_util.rs:64-74 \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":"datafusion/physical-expr/src/proto_test_util.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"919ccaa162e81f2759833454ad37a255383544a472e0e3c225c6458ea6519f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): datafusion/physical-plan/src/test.rs:322-342 | datafusion/physical-plan/src/test.rs:369-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/test.rs:322\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/test.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ab441a1b78d21032dbf18c7c4e47d779093be921b6ca934affd7b33a08118d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): datafusion/core/src/test_util/mod.rs:81-100 | datafusion/physical-plan/src/test.rs:421-440 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"datafusion/core/src/test_util/mod.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7655d30d0c9c70405fc47dd73e1900f15121de9c643f8684684bf217cf535cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): test-utils/src/array_gen/string.rs:32-51 | test-utils/src/array_gen/string.rs:56-75 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060test-utils/src/array_gen/string.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":"test-utils/src/array_gen/string.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d46924d595e765b0d5a454b73cb1f53005341a95fc5af635210426c43210cfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/physical-plan/src/test.rs:450-458 | datafusion/physical-plan/src/test.rs:471-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/physical-plan/src/test.rs:450\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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, \u0060datafusion/physical-plan/src/test.rs:459\u0060 calls \u0060from\u0060, \u0060clone\u0060 and \u0060datafusion/physical-plan/src/test.rs:480\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":"datafusion/physical-plan/src/test.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdab40b71f813327f0761fd9279e4dbed6574f0fffa5d563eeff11cbf545a31d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): datafusion/sqllogictest/src/test_context/range_partitioning.rs:132-143 | datafusion/sqllogictest/src/test_context/range_partitioning.rs:157-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 \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:132\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:167\u0060 calls \u0060Int32\u0060, \u0060Some\u0060 and \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:145\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":"datafusion/sqllogictest/src/test_context/range_partitioning.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"773846b2211bf11fa2c1596b716e3a6acb54619f6ac4c757083bbfab9d1c30a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): datafusion/sqllogictest/src/test_context/range_partitioning.rs:111-117 | datafusion/sqllogictest/src/test_context/range_partitioning.rs:134-143 | datafusion/sqllogictest/src/test_context/range_partitioning.rs:159-165 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:111\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:119\u0060 calls \u0060Int32\u0060, \u0060Some\u0060 and \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:145\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":"datafusion/sqllogictest/src/test_context/range_partitioning.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dcb6a5cb99201ca5d9c560a0a8efab24a8002e7065b49ce881e0467d86a258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): datafusion/sqllogictest/src/test_context/range_partitioning.rs:78-83 | datafusion/sqllogictest/src/test_context/range_partitioning.rs:118-123 | datafusion/sqllogictest/src/test_context/range_partitioning.rs:166-171 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:78\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:86\u0060 calls \u0060join\u0060 and \u0060datafusion/sqllogictest/src/test_context/range_partitioning.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":"datafusion/sqllogictest/src/test_context/range_partitioning.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d256546a93c1bf18bdf5a3abe10a5cd5191ea097cc8bf4a278548963500d901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): test-utils/src/array_gen/binary.rs:31-36 | test-utils/src/array_gen/binary.rs:54-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 \u0060test-utils/src/array_gen/binary.rs:31\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-utils/src/array_gen/binary.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c370557c6c95952f93ebffc7fa3e5557eb79d96d9c97e2b2657af349ba1910be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): datafusion/sqllogictest/src/test_context/range_partitioning.rs:73-77 | datafusion/sqllogictest/src/test_context/range_partitioning.rs:111-117 | datafusion/sqllogictest/src/test_context/range_partitioning.rs:134-143 | datafusion/sqllogictest/src/test_context/range_partitioning.rs:159-165 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:73\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:79\u0060 calls \u0060Int32\u0060, \u0060Some\u0060 and \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:145\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":"datafusion/sqllogictest/src/test_context/range_partitioning.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55bec78dba5cb1b1ff44cb89af94398d4d2105663b81ca35ac7859c11eab015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): datafusion/sqllogictest/src/test_context/range_partitioning.rs:119-127 | datafusion/sqllogictest/src/test_context/range_partitioning.rs:144-152 | datafusion/sqllogictest/src/test_context/range_partitioning.rs:167-175 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:119\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:117\u0060 calls \u0060Int32\u0060, \u0060Some\u0060 and \u0060datafusion/sqllogictest/src/test_context/range_partitioning.rs:142\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":"datafusion/sqllogictest/src/test_context/range_partitioning.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ece76f9668ffc1a4f10eccbb834771955746306bb29c0e2f89600a914631ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): test-utils/src/tpcds.rs:606-612 | test-utils/src/tpch.rs:127-133 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060test-utils/src/tpcds.rs:606\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-utils/src/tpcds.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f31b105b02a7c5feb6b23bf8960229ffedd7514a5a5891cea5792847cced9ad"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project datafusion: datafusion has instability 0.87 with 4 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"111443f56979f927553ff43960f83544c1860f7d1c50982250bca2678485279c"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project datafusion-catalog-listing: datafusion-catalog-listing has instability 0.83 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ff9974953b775403086218af05e7e7b10081d32c5b2182040267a0ae73401049"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project datafusion-datasource-arrow: datafusion-datasource-arrow has instability 0.82 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f05a7253600b3b6935058f8df89bb7d690b6658c3e235cda420a99094655d2b7"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project datafusion-datasource-avro: datafusion-datasource-avro has instability 0.83 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"93cc2680092d0041a33f05729392017061e2d7f609c397eddd64d9a2ac0210e0"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project datafusion-datasource-csv: datafusion-datasource-csv has instability 0.83 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3d33a5ab0d2d0778ac0fbf33c74475ff34fc4de90c7bda1901549c9717fd2007"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project datafusion-datasource-json: datafusion-datasource-json has instability 0.82 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2055751e83eb65541b4e584077790fa47a74c134980134df5a1028168665a534"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project datafusion-datasource-parquet: datafusion-datasource-parquet has instability 0.88 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a75629efb33162acd715e691198354172b210d083a0ac897612058b249f09080"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project datafusion-functions-nested: datafusion-functions-nested has instability 0.83 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea0fc35e33c0a62895d96761cb83c973e5e8e355de5c38d7dfc12e53f30ad18f"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project datafusion-physical-optimizer: datafusion-physical-optimizer has instability 0.83 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"961a7288dc5ecda7ccf33ef22c592090421c0ee83d12557202772b004aec62b3"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project datafusion-proto: datafusion-proto has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0f7b893f0957fb2698b0a4d4ac0dc23e0a670b543b659162c29afc4f8d597592"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: datafusion-doc: datafusion-doc: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"23dc982be04aacc601296c27a174ee68120e3152a6d51085e6fb785dc1e88a62"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: datafusion-proto-models: datafusion-proto-models: abstractness 0.00, instability 0.14, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 12 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"291b1711d288c0c799ffcf7c2494c56d4ed610bcfa7d5994fbe64a5143ff8782"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CsvSource (LCOM4 7): CsvSource\u0027s methods fall into 7 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 7 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":"datafusion/datasource-csv/src/source.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02fed361de7de6e7747ec49d26f2f9e432c38fe49f3727ee5c2f100d9382646"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TaskContext (LCOM4 7): TaskContext\u0027s methods fall into 7 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 7 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":"datafusion/execution/src/task.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f345750a9693c7d68ac0e1eb53c9b35137e5c90dadfe0a7d4b9c8832f31e792"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Sum (LCOM4 7): Sum\u0027s methods fall into 7 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 7 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":"datafusion/functions-aggregate/src/sum.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fecbb9cae0c17f6344454be4796a9d6c48cb89bd6ad102457fad64ce63acb10"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GetFieldFunc (LCOM4 6): GetFieldFunc\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":"datafusion/functions/src/core/getfield.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ccb28084e2d90ab2e586d15af6f293c23b00ddfff7e6688f22d5117e642014"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Count (LCOM4 6): Count\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":"datafusion/functions-aggregate/src/count.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b6c0ea95a0bbea72b0037ee4c83be56352a613abc2859dbc3e1ba040fd0a04"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PlanProperties (LCOM4 6): PlanProperties\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":"datafusion/physical-plan/src/execution_plan.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"289cdc8df72409e607f8b6bae7a5c946260b05fbe505a260fa99f3cc961886c1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InformationSchemaConfig (LCOM4 5): InformationSchemaConfig\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":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ebbd178333d07e93d41f7bdc94060b522fedbd93955ae4dff934296003de32"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SQLOptions (LCOM4 5): SQLOptions\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":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"074e668bb4855d02401ece499117d4f774cc889b07688c6d346dff3ce811becc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PartitionedFile (LCOM4 5): PartitionedFile\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":"datafusion/datasource/src/mod.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3dc8ffb84faaba9625a2866dc040ba0a02701d3be42e7c5725fe9531a3c600"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ArrowFormat (LCOM4 5): ArrowFormat\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":"datafusion/datasource-arrow/src/file_format.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9ac2f9d1dc8f51ea45ecbf5e9875c5678cdd0030f8d40c3f2517c5b978fb20"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Interval (LCOM4 5): Interval\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":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea2dbf5234c76f6de76f071a7271bac369ce01dccebf67af3978f451c7703d9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FFI_ExtensionOptions (LCOM4 5): FFI_ExtensionOptions\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":"datafusion/ffi/src/config/extension_options.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61c4e2d93059858bf8c79e3de9613a550a3c7dc326c5cf88d0c065e3dbdbbf6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CoalesceFunc (LCOM4 5): CoalesceFunc\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":"datafusion/functions/src/core/coalesce.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"98aa19e886c4e3331062d1f5ad9d9174500477bfe5380949de721423b969db91"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GroupByMetrics (LCOM4 5): GroupByMetrics\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":"datafusion/physical-plan/src/aggregates/group_values/metrics.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e70a3c96296fcea433aff35f69ab30d2784226b429720da22df9bef16d96ac"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PlannerContext (LCOM4 5): PlannerContext\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":"datafusion/sql/src/planner.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb9158282c4393a3ba3a55ad776becd91c8fac1e3faff7b79c5bd788a11fbab"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SubstraitConsumerContext (LCOM4 5): SubstraitConsumerContext\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":"datafusion/substrait/src/logical_plan/consumer/substrait_consumer.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91af38b0ccf2caf5cc7da32657232835e1799998f6ee43774b6511aeb2f6dbc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GraphvizBuilder (LCOM4 4): GraphvizBuilder\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":"datafusion/common/src/display/graphviz.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc7a19e7b383e68502c7498289f840e00f24d6c25188216677d3fc14caa2adc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DataFrameWriteOptions (LCOM4 4): DataFrameWriteOptions\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":"datafusion/core/src/dataframe/mod.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"748119c54a996aef22eefe5ad6361e5cded8c9dec6eef059fcbd3e1a2a9a3e07"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FFI_QueryPlanner (LCOM4 4): FFI_QueryPlanner\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":"datafusion/ffi/src/query_planner.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e60fe8ef194fdffcd01294d261c40a3a762f2a9f352b589dadb3dc4c0b6812c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FFI_TableProviderFactory (LCOM4 4): FFI_TableProviderFactory\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":"datafusion/ffi/src/table_provider_factory.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a77b354254dc2f24e526143c453121bb1f7929bd7239ac587bc9d4cfa6a5672"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DateBinFunc (LCOM4 4): DateBinFunc\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":"datafusion/functions/src/datetime/date_bin.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afb48854069cd127a5ee52f9c58f9f9fc7a122e380a093e23c1f304944c6175"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DateTruncFunc (LCOM4 4): DateTruncFunc\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":"datafusion/functions/src/datetime/date_trunc.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b929768f1985b6748a1007b637ca72e9b098e491fc2a5ab09105a494d67354d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RegexpLikeFunc (LCOM4 4): RegexpLikeFunc\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":"datafusion/functions/src/regex/regexplike.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"da734d2f010e20e1ce11cdfd397bb1c03707917e342d8617fe0a2f1ba9ce29d0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ArrayAgg (LCOM4 4): ArrayAgg\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":"datafusion/functions-aggregate/src/array_agg.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0d7b533fd9f2c61d72b66a885e01cbf0b6b04de66c1bd3b61db832f9e68554"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Avg (LCOM4 4): Avg\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":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0acf5a2ca92f0a06e31e30d2c4510cfec370e2f799c4b478a39855af0c2ea5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NegativeExpr (LCOM4 4): NegativeExpr\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":"datafusion/physical-expr/src/expressions/negative.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8688f7c3d90e4532288add35ac15b8808da12f195fd4bc02512ca6f17fb72ae"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NotExpr (LCOM4 4): NotExpr\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":"datafusion/physical-expr/src/expressions/not.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb4740b292ddc51dbd658e376482b9452863388a8e7365b8df7f3a4a5209bba"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InterleaveExec (LCOM4 4): InterleaveExec\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":"datafusion/physical-plan/src/union.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32cbe15349647d2bb1bab54f331ee58c664066adecb667ae29793d13834b75d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/sql/src/statement.rs: datafusion/sql/src/statement.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 214 in SqlToRel::sql_statement_to_plan_with_context_impl at line 254. 6 of those changes were fix/bug commits, and the other 12 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/sql/src/statement.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/statement.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9760c685351fb84c590e574971da51bc0a375c01f606ead09efe304f6b1677f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs: datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 180 in Simplifier::f_up at line 855. 12 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd974ca04f5f23eb5a6032e2c6e9aff76cf083336cf97fd31099cf2d895f23e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/core/src/physical_planner.rs: datafusion/core/src/physical_planner.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in DefaultPhysicalPlanner::map_logical_node_to_physical at line 786. 5 of those changes were fix/bug commits, and the other 23 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/core/src/physical_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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"b353c60b6b6b04252d0728feae74a8f7a1ee1de8d8c8b09f5c81f0f4c93fec99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/expr/src/logical_plan/plan.rs: datafusion/expr/src/logical_plan/plan.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in LogicalPlan::display at line 2173. 13 of those changes were fix/bug commits, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/expr/src/logical_plan/plan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":2173}}}],"partialFingerprints":{"codehealthFindingId/v1":"336523ffa736ee085c1430c82a81dd7228bb13fbe33eca79a1144a285356b8ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/push_down_filter.rs: datafusion/optimizer/src/push_down_filter.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in PushDownFilter::rewrite at line 849. 10 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/push_down_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":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c28bd5c4570a460048df4d4475874278c0d9a42e69835469a4405ad16aa69c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/sql/src/unparser/plan.rs: datafusion/sql/src/unparser/plan.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 125 in Unparser::select_to_sql_recursively at line 837. 4 of those changes were fix/bug commits, and the other 10 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/sql/src/unparser/plan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/plan.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"5233005770810a20e8df10c44cc6c4db3a0b35dcce72b3d40921379203022ea9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/decorrelate.rs: datafusion/optimizer/src/decorrelate.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in PullUpCorrelatedExpr::f_up at line 395. 13 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/decorrelate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79fcfa516ff25372b3d2d7019b2408417d70f6ba9e43f3bd7b04fbb6acef6f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/proto-common/src/generated/pbjson.rs: datafusion/proto-common/src/generated/pbjson.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 121 in ParquetOptions::deserialize at line 6796. 3 of those changes were fix/bug commits, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/proto-common/src/generated/pbjson.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/generated/pbjson.rs"},"region":{"startLine":6796}}}],"partialFingerprints":{"codehealthFindingId/v1":"6023f4798abe8390f0fa73c0ecc9addf52345e53da3820521a68dc2b71d65c28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/proto-common/src/from_proto/mod.rs: datafusion/proto-common/src/from_proto/mod.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in ScalarValue::try_from at line 385. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/proto-common/src/from_proto/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":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"942cf147ef2e608704277b631cf13b9c4e9be0509ad4886b46df1a03de81bb20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-plan/src/joins/hash_join/exec.rs: datafusion/physical-plan/src/joins/hash_join/exec.rs changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in datafusion_physical_plan::joins::hash_join::exec::build_in_memory at line 3229. 22 of those changes were fix/bug commits, and the other 33 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/joins/hash_join/exec.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4d1ce624ed26578ffcaaeed72513ea3dab0b389fb67e6c2cc64bfbf7590c77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/common/src/scalar/mod.rs: datafusion/common/src/scalar/mod.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in ScalarValue::fmt at line 5858. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/common/src/scalar/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":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":5858}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93c596726052ea50fd92bf20527d8e895565ae8cdbf6415cd138b5bb29130fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/sql/src/unparser/expr.rs: datafusion/sql/src/unparser/expr.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in Unparser::expr_to_sql_inner at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/sql/src/unparser/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":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"94901961d6b6f5ed4793800f54e7a501dd64237cf1d6652bed3b8d329fbbba4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/decorrelate_predicate_subquery.rs: datafusion/optimizer/src/decorrelate_predicate_subquery.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in datafusion_optimizer::decorrelate_predicate_subquery::build_join at line 870. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/decorrelate_predicate_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":"datafusion/optimizer/src/decorrelate_predicate_subquery.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2ff3290ecf0f9ef7efddcbfef2c1ddf1824175384f61994d9302de685c8117"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/analyzer/type_coercion.rs: datafusion/optimizer/src/analyzer/type_coercion.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in TypeCoercionRewriter::f_up at line 698. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/analyzer/type_coercion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/analyzer/type_coercion.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"be412b1901a562b2572f0b3ff2bb6f8ec1c9cec0d502bd4bbf780edd4a4ec927"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/sql/src/expr/function.rs: datafusion/sql/src/expr/function.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in SqlToRel::sql_function_to_expr at line 215. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/sql/src/expr/function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/function.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8d9165cc0e493f6dc59c2eee96501498379923325e87f91a01923eea1491ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/pruning/src/pruning_predicate.rs: datafusion/pruning/src/pruning_predicate.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in datafusion_pruning::pruning_predicate::build_predicate_expression at line 1764. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/pruning/src/pruning_predicate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"2166e1e482b37025960a45a145f468f078fd4598e6c26086261db2d5300e05be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/expr/src/logical_plan/display.rs: datafusion/expr/src/logical_plan/display.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in PgJsonVisitor::to_json_value 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/expr/src/logical_plan/display.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/display.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"355897c99662f68fae2629a4d5d6b66a5adb91a1c362d215c1886516307b4425"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/sql/src/expr/mod.rs: datafusion/sql/src/expr/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in SqlToRel::sql_expr_to_logical_expr_internal at line 385. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/sql/src/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":"datafusion/sql/src/expr/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b14f2c499ce7e1aacc1edf7ff8ce743f1183ed0a35f244f6feb6ce10bc4b3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/expr/src/expr_schema.rs: datafusion/expr/src/expr_schema.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Expr::nullable at line 299. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/expr/src/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":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cb96ad0aa1e49c1998308ba530f6b06beb661534ab546373040ae3ba2a23e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs: datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in datafusion_physical_optimizer::ensure_requirements::enforce_distribution::ensure_distribution_with_stats at line 1653. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/ensure_requirements/enforce_distribution.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"d947b80468b7c13c850440b81fe7266f7588f5cf37245fd7a15ec9d6438c3446"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/expr/src/expr.rs: datafusion/expr/src/expr.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in SchemaDisplay::fmt at line 3067. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/expr/src/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":"datafusion/expr/src/expr.rs"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb203feb3790079377a39eba11209db81056ac4048c4363cae2f003901ef1234"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-plan/src/joins/nested_loop_join.rs: datafusion/physical-plan/src/joins/nested_loop_join.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in datafusion_physical_plan::joins::nested_loop_join::build_unmatched_batch at line 4149. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/joins/nested_loop_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":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a2871202096c9d8e1003b86d546639822ee72b181d88883d24b643cabc6840"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs: datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in GroupedHashAggregateStream::poll_next at line 652. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"659a8f178f9247627dcdb807207ee0a72e9e1055750a89e4157e9dc405d7322b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/functions/src/datetime/date_bin.rs: datafusion/functions/src/datetime/date_bin.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in datafusion_functions::datetime::date_bin::date_bin_impl at line 630. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/functions/src/datetime/date_bin.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/date_bin.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd1360c3e939e5d752b873af91a81ccd295eaf0dd68d52133aba1ecc7c1fd61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/datasource-parquet/src/opener/mod.rs: datafusion/datasource-parquet/src/opener/mod.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ParquetOpenState::transition at line 613. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/datasource-parquet/src/opener/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":"datafusion/datasource-parquet/src/opener/mod.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"febea58713a5604c28a4fa89ba27b2a9b47f10fc37f4d4a204da808a88d4e8cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/functions/src/datetime/date_trunc.rs: datafusion/functions/src/datetime/date_trunc.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in DateTruncFunc::invoke_with_args at line 246. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/functions/src/datetime/date_trunc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/date_trunc.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3b450a687e6efd0e3bdbbd173e5f124de2f5af37860891c8591e2e24e7e18b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/optimize_projections/mod.rs: datafusion/optimizer/src/optimize_projections/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in datafusion_optimizer::optimize_projections::optimize_projections at line 123. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/optimize_projections/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":"datafusion/optimizer/src/optimize_projections/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2fe90c4d4d7b2ae1825c4ac282945e7b6ba88aaba3a0ede687db8fdb3c8a40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-expr/src/planner.rs: datafusion/physical-expr/src/planner.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in datafusion_physical_expr::planner::create_physical_expr at line 120. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-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":"datafusion/physical-expr/src/planner.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d274f559f7f52a31eecfda6b082043eb498d5c94943429d4b9f862d1808776"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/sql/src/planner.rs: datafusion/sql/src/planner.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in SqlToRel::convert_simple_data_type at line 705. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/sql/src/planner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/planner.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b463ef279e91c7b4c8e1f6ecc1a723fcf2bb7efd2e17bb2b5096fefcf7a9ee1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/expr/src/type_coercion/functions.rs: datafusion/expr/src/type_coercion/functions.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in datafusion_expr::type_coercion::functions::get_valid_types at line 571. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/expr/src/type_coercion/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":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8fb431d54600d6f70dc56ee3ee118a886b313c0167685510a0fd593d3cac98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs: datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in datafusion_physical_optimizer::ensure_requirements::enforce_sorting::sort_pushdown::pushdown_requirement_to_children at line 442. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b97e5684c4d3f05018413fa560c70ace0e018f7ea8174e58ce719801614b294"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/extract_leaf_expressions.rs: datafusion/optimizer/src/extract_leaf_expressions.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in datafusion_optimizer::extract_leaf_expressions::split_and_push_projection at line 1002. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/extract_leaf_expressions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/extract_leaf_expressions.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"389336ca47b965a60c563571fdbcb35a19d90446514b954181e780081d1ddcdf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/proto-models/src/from_proto.rs: datafusion/proto-models/src/from_proto.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in CsvOptions::try_from at line 183. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/proto-models/src/from_proto.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-models/src/from_proto.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb9333f38936b41b0138a0dc1d84b1209436b8f19e27ecb42df437efb9f8ce1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/optimizer.rs: datafusion/optimizer/src/optimizer.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in datafusion_optimizer::optimizer::map_children_mut at line 414. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/optimizer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/optimizer.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86e9e22c34411ccc4e8ae662b7699468ccc89aee72841b65714a8442ce22655"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-plan/src/windows/mod.rs: datafusion/physical-plan/src/windows/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in datafusion_physical_plan::windows::window_equivalence_properties at line 372. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/windows/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":"datafusion/physical-plan/src/windows/mod.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f0f635b6ff629ce1d9abfce980a784ab806ec4dfe5a7603be6366764f267b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/core/src/execution/session_state.rs: datafusion/core/src/execution/session_state.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in SessionStateBuilder::build at line 1700. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/core/src/execution/session_state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/session_state.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"353fe2c93516bba9d9a0c3cf58b5228784ee502ebd2afe8693b5d0160ec8c8d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/sql/src/select.rs: datafusion/sql/src/select.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in SqlToRel::select_to_plan at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/sql/src/select.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/select.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da39bf07486179ebbbccb663218bf87f6791788bea72782e0bb7ca09dfb31f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/datasource-parquet/src/push_decoder.rs: datafusion/datasource-parquet/src/push_decoder.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PushDecoderStreamState::transition at line 431. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/datasource-parquet/src/push_decoder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/push_decoder.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caeff7e9cc465b896f16e4a6700651b535bb36f508d6f6948633ebc08601bd6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/catalog-listing/src/table.rs: datafusion/catalog-listing/src/table.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ListingTable::scan_with_args_inner at line 638. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/catalog-listing/src/table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog-listing/src/table.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79d34b053c4b7443ca2bbb3282fff2be11b79f9c040b4400254b807f0f4b9f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-plan/src/spill/mod.rs: datafusion/physical-plan/src/spill/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in SpillReaderStream::poll_next at line 352. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/spill/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":"datafusion/physical-plan/src/spill/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c84cdff28a72d713a979c3c8ab4e2a1f46e33fb366962a113f05b8751c6d52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/datasource/src/write/demux.rs: datafusion/datasource/src/write/demux.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in datafusion_datasource::write::demux::compute_partition_keys_by_row at line 398. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/datasource/src/write/demux.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/write/demux.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"a582f5859dfe781d4e18b6f5ffbe3505c7d1005ec82a7bf27beda7abbc7426ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/expr/src/logical_plan/tree_node.rs: datafusion/expr/src/logical_plan/tree_node.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in LogicalPlan::map_expressions at line 550. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/expr/src/logical_plan/tree_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":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"310cc809e4835f9371dc785c5a597f7e678beecb4c782bee6cf20bd0c2011563"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/proto/src/logical_plan/from_proto.rs: datafusion/proto/src/logical_plan/from_proto.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in datafusion_proto::logical_plan::from_proto::parse_expr at line 157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/proto/src/logical_plan/from_proto.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/from_proto.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d206b6802d5b79b3e0eafb41c1ec91d8ed3d25cc24a1cdbc48e57d9fb30ae41d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-expr-adapter/src/schema_rewriter.rs: datafusion/physical-expr-adapter/src/schema_rewriter.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DefaultPhysicalExprAdapterRewriter::try_narrow_struct_cast at line 484. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-expr-adapter/src/schema_rewriter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-adapter/src/schema_rewriter.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f991ec6d3e67857cfa373db2cf848e765b3be90526cb259f8b511601f8d178"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-plan/src/aggregates/clustered_single_stream.rs: datafusion/physical-plan/src/aggregates/clustered_single_stream.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ClusteredSingleAggregateStream::handle_reading_input at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/aggregates/clustered_single_stream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/clustered_single_stream.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5cd77165d3781d27bc5ef16a0d3112e04acbcb20d5a3cfab70e5056d0f6295"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/proto/src/logical_plan/to_proto.rs: datafusion/proto/src/logical_plan/to_proto.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in datafusion_proto::logical_plan::to_proto::serialize_expr at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/proto/src/logical_plan/to_proto.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/to_proto.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c4fa55c0c408403348a6baa381828ccac7487a6569b290e7865f24590b1341"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/expr-common/src/type_coercion/binary.rs: datafusion/expr-common/src/type_coercion/binary.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in BinaryTypeCoercer::signature_inner at line 184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/expr-common/src/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":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c778b42c62c86746864743801e80fafe603b296fdd2b66ee10b5f7e5c4da9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-expr/src/expressions/in_list.rs: datafusion/physical-expr/src/expressions/in_list.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in InListExpr::evaluate at line 324. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-expr/src/expressions/in_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":"datafusion/physical-expr/src/expressions/in_list.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c41dab115f1a23fb3e56f009cd0bc2c544b83bc39f45fd27ca72c78c917f4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/datasource-parquet/src/page_filter.rs: datafusion/datasource-parquet/src/page_filter.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in PagePruningAccessPlanFilter::prune_plan_with_page_index_and_metrics at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/datasource-parquet/src/page_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":"datafusion/datasource-parquet/src/page_filter.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a357237bf2a6d6ca5bd1adc40c524911500ed95b8957902f81904ca8824831a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/propagate_empty_relation.rs: datafusion/optimizer/src/propagate_empty_relation.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in PropagateEmptyRelation::rewrite 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/propagate_empty_relation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/propagate_empty_relation.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a150b9c678446ec10a502cc40e278c806286876ca0558b23841d7f702b31c0d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: benchmarks/src/bin/benchmark_runner.rs: benchmarks/src/bin/benchmark_runner.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in datafusion_benchmarks::bin::benchmark_runner::cli_action_from_matches at line 414. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- benchmarks/src/bin/benchmark_runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/bin/benchmark_runner.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ba90c928e6d21ec376917ce9d10d33ce5b1442d77b2a1ac06cd232d7126c31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/substrait/src/logical_plan/consumer/rel/read_rel.rs: datafusion/substrait/src/logical_plan/consumer/rel/read_rel.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in datafusion_substrait::logical_plan::consumer::rel::read_rel::from_read_rel at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/substrait/src/logical_plan/consumer/rel/read_rel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/rel/read_rel.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"84098a51efe993a0dad44e9abb96cae9fc550dac6b4e1af91da2202bc8c416fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/decorrelate_lateral_join.rs: datafusion/optimizer/src/decorrelate_lateral_join.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in datafusion_optimizer::decorrelate_lateral_join::rewrite_internal at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/decorrelate_lateral_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":"datafusion/optimizer/src/decorrelate_lateral_join.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"060b23cf040e3db142f5f1dcd3be05c259fad8545aab3aa7f5b76c6657c4ab95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/expr/src/logical_plan/invariants.rs: datafusion/expr/src/logical_plan/invariants.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in datafusion_expr::logical_plan::invariants::check_subquery_expr at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/expr/src/logical_plan/invariants.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/invariants.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ee2c5cc9a2a4bb1ed9217846029ad39425e28b2a4804235b59eecd1af50d6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/proto/src/physical_plan/from_proto.rs: datafusion/proto/src/physical_plan/from_proto.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in datafusion_proto::physical_plan::from_proto::parse_physical_expr_with_converter at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/proto/src/physical_plan/from_proto.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/physical_plan/from_proto.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24177afea0e23ef59a1d73bbe13e81fc144860c9fd601bb348ccceec65cdd11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-plan/src/sorts/multi_level_merge.rs: datafusion/physical-plan/src/sorts/multi_level_merge.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in MultiLevelMergeBuilder::get_sorted_spill_files_to_merge at line 601. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/sorts/multi_level_merge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3f4099cd4345a59fc27b4b6088aaea97060d5b55d585bc2d21abd865a2a3c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/functions-nested/src/range.rs: datafusion/functions-nested/src/range.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Range::gen_range_timestamp at line 419. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/functions-nested/src/range.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/range.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bab81de948c8f54e95986f485002be8c0338d04f3db2f67c49bd6bcedc15b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/push_down_limit.rs: datafusion/optimizer/src/push_down_limit.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in datafusion_optimizer::push_down_limit::rewrite_limit 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/push_down_limit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/push_down_limit.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d675c23da0e0f98e3a6e3b59bf297d68de7606f7c90d083d328f0dde5fcc9619"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/optimizer/src/single_distinct_to_groupby.rs: datafusion/optimizer/src/single_distinct_to_groupby.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in datafusion_optimizer::single_distinct_to_groupby::is_single_distinct_agg 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/single_distinct_to_groupby.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/single_distinct_to_groupby.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7621d78f6c781eebbd4b0be4166b1e045a4b9dae86009c0af38ecc6a22569956"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/datasource/src/boundary_stream.rs: datafusion/datasource/src/boundary_stream.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in AlignedBoundaryStream::poll_next at line 214. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/datasource/src/boundary_stream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/boundary_stream.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"797748526fa471270406c5f0fbd1000687be9c13eb9f563a6fe18e5fdf0f7dc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/functions-nested/src/resize.rs: datafusion/functions-nested/src/resize.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in datafusion_functions_nested::resize::general_list_resize at line 184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/functions-nested/src/resize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/resize.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46c753335afc95d8fa80bb81e0334920e3240c2fcb71f4369ff18d23f76748a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-expr/src/window/standard.rs: datafusion/physical-expr/src/window/standard.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in StandardWindowExpr::evaluate_stateful 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-expr/src/window/standard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/window/standard.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"057beaaf8c1baad978f9a2f141c056f6f78b09c5949da1400e66d5db8777edcd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/core/src/bin/print_functions_docs.rs: datafusion/core/src/bin/print_functions_docs.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in datafusion::bin::print_functions_docs::print_docs at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/core/src/bin/print_functions_docs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/bin/print_functions_docs.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e772729923cf11713e592fe680dac598b459d3fe6311bd7eeec038b529b17b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-plan/src/joins/hash_join/not_in.rs: datafusion/physical-plan/src/joins/hash_join/not_in.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in datafusion_physical_plan::joins::hash_join::not_in::mark_null_candidates_for_probe_batch at line 826. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/joins/hash_join/not_in.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/not_in.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc6a225c005d9e27aab7c9d7f01b0453aac0d256ba2593edfb22927b24c4c31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/sql/src/unparser/utils.rs: datafusion/sql/src/unparser/utils.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in datafusion_sql::unparser::utils::date_part_to_sql at line 437. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/sql/src/unparser/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":"datafusion/sql/src/unparser/utils.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea52aa52fe48b5ff4454c4f70c4bf8b2ddc216d13d6b3d07804a64bb7add92bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-optimizer/src/pushdown_sort.rs: datafusion/physical-optimizer/src/pushdown_sort.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PushdownSort::optimize 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-optimizer/src/pushdown_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":"datafusion/physical-optimizer/src/pushdown_sort.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e796f243f2d98e68f31ebc322206f6d538edb126e6552b058fd8c6147967d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: datafusion/physical-plan/src/joins/array_map.rs: datafusion/physical-plan/src/joins/array_map.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ArrayMap::lookup_and_get_indices at line 274. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/joins/array_map.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/array_map.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bd619448fee2b378bd13a353c702cfec5a784ca8e4b572779bde7741a95231"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/physical-plan/src/sorts/sort.rs: datafusion/physical-plan/src/sorts/sort.rs changed 19 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is SortExec::execute at line 1905), 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: leave memory for others when a spilled sort merges its runs (#26264)\u201D; \u201Cfix: split multi-column sort runs into smaller batches under a memory limit (#26953)\u201D; \u201Cfix: count the largest capacity seen for a shared buffer address (#27097)\u201D; \u201Cfix: give each SortExec reset_state copy its own TopK dynamic filter (revert #26670) (#27142)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/sorts/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":"datafusion/physical-plan/src/sorts/sort.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"954aaf80741ad3dabca7aba67ed265a2130479214f1588415eaef856a8eeaaf7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/physical-plan/src/filter.rs: datafusion/physical-plan/src/filter.rs changed 18 times in last 90 days and 10 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 FilterExec::statistics_under_fetch at line 491), 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: \u201CRevert #25790 (Decimal filter selectivity) due to TPC-H Q18 regression (#27145)\u201D; \u201Cfix: use null counts to estimate IS NULL and IS NOT NULL (#25648)\u201D; \u201Cfix: use NDV for unresolved scalar subquery selectivity instead of 20% fallback (#25719)\u201D; \u201Cfix: keep file order for scans that advertise an output ordering (#26434)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/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":"datafusion/physical-plan/src/filter.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b08671fa817d55380cf773eaf54b03a73da26aceed2552b6b9f7633c7d2e66"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs: datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is BitwiseSortMergeJoinStream::join at line 1192), 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(smj): compare all key types across batch boundaries in semi/anti/mark joins (#26830)\u201D; \u201Cfix: evaluate sort-merge join filters that reference no columns (#26010)\u201D; \u201Cfix: charge semi/anti sort-merge join key groups by their sliced size (#25933)\u201D; \u201Cfix: release semi/anti/mark sort-merge join reservations before the final output (#25986)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/bitwise_stream.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeeda5aed1f29161512553baada5ac5a84b1061940c6d07140b2b286932e0196"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/physical-expr/src/equivalence/class.rs: datafusion/physical-expr/src/equivalence/class.rs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is EquivalenceGroup::exprs_equal at line 920), 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: preserve constant equivalence properties through projection (#27123)\u201D; \u201Cfix: retain only valid orderings after order-preserving repartition (#26747)\u201D; \u201Cfix: treat an uncorrelated scalar subquery as a constant in ordering checks (#26836)\u201D; \u201Cfix: keep a constant sort key when a projection reads a duplicate alias (#26397)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-expr/src/equivalence/class.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/class.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc22a2892ddf106bd9ed7ff4ce2d8cc4556c2c43e0ca8d4faca8b4a6ae8569b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/datasource/src/file_scan_config/mod.rs: datafusion/datasource/src/file_scan_config/mod.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is FileScanConfig::fmt_as at line 786), 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: declare Hive partitioned scans as Range (#25279)\u201D; \u201Cfix: include nulls in file ordering bounds (#26280)\u201D; \u201Cfix: keep file order for scans that advertise an output ordering (#26434)\u201D; \u201Cfix: derive scan equivalences only from filters the source applies exactly (#25780)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/datasource/src/file_scan_config/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":"datafusion/datasource/src/file_scan_config/mod.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a97de27e20345b4b272b14c54b8110c861f3345f75852a647d13629a7d878a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/physical-plan/src/sorts/streaming_merge.rs: datafusion/physical-plan/src/sorts/streaming_merge.rs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is StreamingMergeBuilder::build at line 225), 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: leave memory for others when a spilled sort merges its runs (#26264)\u201D; \u201Cfix: split multi-column sort runs into smaller batches under a memory limit (#26953)\u201D; \u201Cfix: size aggregate spill batches by bytes as well as rows (#25853)\u201D; \u201CFix GroupValues retained memory accounting (#25188)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/sorts/streaming_merge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/streaming_merge.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"547f07fea628fe715a39566efe6f798347cdc09f9a799a32290272dd2502e0e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/physical-plan/src/aggregates/group_values/row.rs: datafusion/physical-plan/src/aggregates/group_values/row.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is datafusion_physical_plan::aggregates::group_values::row::encode_array_if_necessary at line 328), 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: release clustered aggregate table capacity after emitting completed groups on memory pressure (#26726)\u201D; \u201CFix GroupValues retained memory accounting (#25188)\u201D; \u201Cfix: clear_shrink(0) on rows should reset to original size \u002B single group by fixes in clear_shrink (#25914)\u201D; \u201Cfix: support zero-field struct group keys in aggregate emit (#25282)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/aggregates/group_values/row.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/row.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7645d15ecfe5744b7e5341ff8d5328debf44f0ffcea964e4058446f42de5375"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs: datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is MaterializingSortMergeJoinStream::join at line 703), 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: evaluate sort-merge join filters that reference no columns (#26010)\u201D; \u201Cfix: allow NULL-padded rows in sort-merge join filter evaluation (#26027)\u201D; \u201Cfix: end a sort-merge join partition once its streamed side is exhausted, and release its reservations before the final output (#25206)\u201D; \u201Cfix: sort-merge join filter columns follow the filter\u0027s own column order (#25489)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a7bb97d396c99cccf22c3156b65ff9478fcd1c2554a5f921787a5e02fd3229"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/optimizer/src/utils.rs: datafusion/optimizer/src/utils.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 6 (its worst body is datafusion_optimizer::utils::is_duplicate_insensitive_aggregate at line 68), 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: keep constant filters above grand totals (#27117)\u201D; \u201Cfix: use session timezone for timestamp subtraction and comparison (#25094)\u201D; \u201Cfix: respect volatility for all function expressions (#25511)\u201D; \u201Cfix: preserve MERGE target qualifier bindings (#24429)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/optimizer/src/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":"datafusion/optimizer/src/utils.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19e527039b8f5cf0afc5d94c57c49de274de894d72aa2fb1be09947b417c62d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/datasource-csv/src/file_format.rs: datafusion/datasource-csv/src/file_format.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 14 (its worst body is CsvFormat::infer_schema_from_stream at line 526), 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(proto): preserve CSV sink writer options (#25058)\u201D; \u201Cfix: return an error for an invalid CSV null_regex instead of panicking (#25261)\u201D; \u201Cfix(proto): check integer conversions in common options and constraints (#24726)\u201D; \u201Cfix: reject duplicate field names during CSV and Parquet schema inference (#24387)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/datasource-csv/src/file_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":"datafusion/datasource-csv/src/file_format.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"c954f39b937be7cac8f9859d6880c9807930978ff6808150af67fadd639787d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/physical-plan/src/sorts/stream.rs: datafusion/physical-plan/src/sorts/stream.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 10 (its worst body is IncrementalSortIterator::next at line 411), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: size aggregate spill batches by bytes as well as rows (#25853)\u201D; \u201Cfix: avoid quadratic row-buffer accounting in sort merges (#26366)\u201D; \u201Cfix: Account for buffered rows in \u0060RowCursorStream\u0060 (#25372)\u201D; \u201Cfix: report correct number of items left in the iterator for \u0060IncrementalSortIterator\u0060 (#25107)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/sorts/stream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/stream.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be84e01af034492d1ab1cefa4e528c634df7749eb1ae71d16dffc28632f89f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/expr-common/src/interval_arithmetic.rs: datafusion/expr-common/src/interval_arithmetic.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 13 (its worst body is datafusion_expr_common::interval_arithmetic::apply_operator at line 1034), 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: \u201CRevert #25790 (Decimal filter selectivity) due to TPC-H Q18 regression (#27145)\u201D; \u201Cfix: handle zero endpoints in division interval bounds (#25985)\u201D; \u201Cfix: avoid query failures from inferred numeric cast bounds (#25528)\u201D; \u201Cfix: preserve unbounded multiplication interval endpoints (#25795)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/expr-common/src/interval_arithmetic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"359dda7a9456a96228452a59afecab71486e3495c534327f733df976f69b5d20"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/common/src/parquet_config.rs: datafusion/common/src/parquet_config.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 11 (its worst body is DFParquetEncoding::from_str at line 295), 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: validate parquet encoding when configured (#25784)\u201D; \u201Cfix: validate parquet.coerce_int96 when it is set (#25628)\u201D; \u201Cfix: validate parquet.compression when it is set (#25626)\u201D; \u201Cfix: validate parquet statistics config (#24642)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/common/src/parquet_config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/parquet_config.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9079c5ddf869c7dfd32aa9605d43b4769101d9311892cc467f42e56c201740"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/physical-plan/src/unnest.rs: datafusion/physical-plan/src/unnest.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 8 (its worst body is UnnestStream::poll_next_impl at line 612), 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: preserve nulls when unnesting structs (#25389)\u201D; \u201Cfix(proto): check plan integer conversions across usize boundaries (#24483)\u201D; \u201Cfix: count UnnestExec output batches after splitting (#24482)\u201D; \u201Cfix: make UnnestExec respect datafusion.execution.batch_size (#24384)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/unnest.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/unnest.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77b4f412962b4bce0aeb935726926de8ef3fdda302ad91a9988ec40bb2505e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/physical-plan/src/aggregates/group_values/single_group_by/primitive.rs: datafusion/physical-plan/src/aggregates/group_values/single_group_by/primitive.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 5 (its worst body is GroupValuesPrimitive::intern at line 122), 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: release clustered aggregate table capacity after emitting completed groups on memory pressure (#26726)\u201D; \u201Cfix(physical-plan): replace approximate map_size accounting with exac\u2026 (#25825)\u201D; \u201CFix GroupValues retained memory accounting (#25188)\u201D; \u201Cfix: clear_shrink(0) on rows should reset to original size \u002B single group by fixes in clear_shrink (#25914)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/physical-plan/src/aggregates/group_values/single_group_by/primitive.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/single_group_by/primitive.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4ebd06768761aa98b41da17ca7de2e517d7ee480017aa03cd4d0941a9c7693"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/functions-aggregate/src/average.rs: datafusion/functions-aggregate/src/average.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 Avg::accumulator at line 279), 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 panic from \u0060avg(x ORDER BY y)\u0060 (and more) (#25711)\u201D; \u201CFix AvgGroupsAccumulator::size() self-overcount (#25117)\u201D; \u201Cfix: Address avg return type overflow for decimals (#24371)\u201D; \u201Cchore: fix malformed example tables in aggregate function docs (#24503)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/functions-aggregate/src/average.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/average.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"26be03c3290d2f32269bd0078624ccd6b1b0a300c1d371f7a15041802d0542b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/functions-aggregate/src/bit_and_or_xor.rs: datafusion/functions-aggregate/src/bit_and_or_xor.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 4 (its worst body is BitwiseOperation::state_fields at line 246), 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: return NULL from \u0060bit_xor\u0060 when a sliding frame has no non-NULL values (#26485)\u201D; \u201Cfix: reject groups accumulator for NULL-typed bitwise aggregates (#25687)\u201D; \u201CFix panic from \u0060avg(x ORDER BY y)\u0060 (and more) (#25711)\u201D; \u201Cfix: reject groups accumulator for bit_xor(DISTINCT) (#24989)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/functions-aggregate/src/bit_and_or_xor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/bit_and_or_xor.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4542fe4af3145a0d49676beeb39626542ffe1ec6e3a6c440e68817115940d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/functions/src/math/log.rs: datafusion/functions/src/math/log.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 10 (its worst body is LogFunc::invoke_with_args at line 260), 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: preserve precision in log() with mixed-width float arguments (#23676)\u201D; \u201Cfix(functions): prevent invalid sort omission in log monotonicity when base \u003C= 1 (#25746)\u201D; \u201Cfix: preserve nested log and power results (#25138)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/functions/src/math/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":"datafusion/functions/src/math/log.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"9086a94fbe7ab8487a75bf996e1659a569e7a20871c121502da8401e8296ebcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/functions/src/regex/regexplike.rs: datafusion/functions/src/regex/regexplike.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 10 (its worst body is datafusion_functions::regex::regexplike::handle_regexp_like at line 429), 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: report regex compile failures as DataFusion errors, consistently across the regexp family (#25352)\u201D; \u201Cfix: accept empty flags in regexp_like and regexp_match (#25046)\u201D; \u201Cfix(optimizer): bound planning-time regex compilation (#24917)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/functions/src/regex/regexplike.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/regex/regexplike.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"751413661cbfea5ee461961742ca4f6b4fd781be8f2f642a8887bbbe3e1a64b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: datafusion/functions-nested/src/cosine_distance.rs: datafusion/functions-nested/src/cosine_distance.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 datafusion_functions_nested::cosine_distance::general_cosine_distance at line 148), 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: clamp cosine_distance to enforce metric non-negativity and boundedness [0.0, 2.0] (#25744)\u201D; \u201Cfix: avoid overflow and underflow in vector functions (#25289)\u201D; \u201Cchore: fix the remaining malformed example tables in function docs (#24596)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:26:28 \u002B00:00\u0027 --until=\u00272026-11-14 14:26:28 \u002B00:00\u0027 --full-history --no-merges -- datafusion/functions-nested/src/cosine_distance.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/cosine_distance.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1053fbecf19807fa3f09c55a79c019c2bce69aa305b2c4628d7a5cfd1b2fc28d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 6 significant file(s) lose their only recent owner: benchmarks/src/util/simulated_object_store.rs, datafusion/physical-plan/src/proto_test_util.rs, datafusion/physical-plan/src/proto/registry.rs, datafusion/proto-models/src/registry.rs, datafusion/datasource/src/proto.rs, datafusion/datasource-parquet/src/opener/early_stop.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"deaff3c3829ecde7304e0818c58424bd8d4bdfd7942c18b059f3dbb688101b8c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 5 significant file(s) lose their only recent owner: datafusion/datasource/src/morsel/mocks.rs, datafusion/datasource/src/morsel/mod.rs, datafusion/datasource/src/file_stream/metrics.rs, datafusion/common-runtime/src/join_set.rs, datafusion/datasource/src/file_stream/builder.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"92ce7f5f2514c73312188f8103f4dd7a8221734eea3b88ca876212100e4a74f9"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 4 significant file(s) lose their only recent owner: datafusion/physical-plan/src/joins/logical_batch.rs, benchmarks/compile_profile.py, xtask/src/main.rs, datafusion/common/src/display/graphviz.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"68485213518af6c59d04ea05ed24eb02d3871c57da9672e2de0465e9b1837432"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 4 significant file(s) lose their only recent owner: datafusion/physical-expr/src/expressions/in_list/branchless_filter.rs, datafusion/physical-expr/src/expressions/in_list/byte_view_filter.rs, datafusion/physical-expr/src/expressions/in_list/dictionary_filter.rs, datafusion/physical-expr/src/expressions/in_list/result.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fa7f8d5aca570d3b0698027f1e1a9f6ffa4ff7cfc968e36bf2e4c8bacf2ced33"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 12 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 (37 single-owned of 995 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; 995 of the 1160 production source files in this repository met that bar). They are anonymized user #5 (2 file(s)), anonymized user #6 (2 file(s)), anonymized user #7 (2 file(s)), anonymized user #8 (2 file(s)), anonymized user #9 (2 file(s)), anonymized user #10 (2 file(s)) (\u002B6 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: datafusion/sqllogictest/src/config_matrix.rs, dev/release/download-python-wheels.py, datafusion/pruning/src/primitive_in_list.rs, datafusion/pruning/src/in_list.rs, datafusion/execution/src/memory_pool/drift.rs, datafusion/sqllogictest/src/memory_drift.rs, datafusion/physical-plan/src/sorts/merge_trace.rs, test-utils/src/array_gen/decimal.rs (\u002B10 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support generating more primitive 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":"test-utils/src/array_gen/primitive.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a9288c3bfd7e5912ab24a7b7b0ca558e9a6d59141824efdb61488636c22626"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: constrain this range to valid dates if necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-utils/src/array_gen/random_data.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8106b7b21046a8aa63adfbf9ad40dbc111b51f52727bc08ff33d23b7cb36b74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO maybe we can have thiserror for cli but for now let\u0027s keep it simple \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion-cli/src/main.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bac8d8e5b1cf09b9a6ffd6106e93a3c3e01b1060d85b5e363f46eebfff5cbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment repeated across 10 files: The identical TodoComment appears in 10 files (35 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 35 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// TODO (https://github.com/apache/datafusion/issues/17477) avoid recomparing all fields\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/tests/cases/roundtrip_logical_plan.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4c5907902ac1e812dae931e885c99cb8c659436afdcb88f031599c627da9d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: would be nice to have a struct inside the LargeList, but arrow_cast doesn\u0027t support that currently \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/tests/cases/roundtrip_logical_plan.rs"},"region":{"startLine":2150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb6d82701ca7275f59ba9e7cf8abcf02b7291ca8cade9478a937b070dfb2fd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo use core array_transform when it supports multiple lambda parameters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/tests/cases/roundtrip_logical_plan.rs"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0b429d9ba5922c3c299393473991be74ab3edb3b704c3a527e1031ca1aadba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: DF doesn\u0027t yet use extensions for type variations \u003Chttps://github.com/apache/datafusion/issues/11544\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/extensions.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"867f19744316b86b8405dec4ae83c4a50f6502dd10c74420d969fbf34d70cb26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: DF doesn\u0027t yet provide valid extensionUris \u003Chttps://github.com/apache/datafusion/issues/11545\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/extensions.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"726c79f75f54e8523a5864c8b522642661e74e0f25e6672943e39f9773f8c528"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Definitions here are not the final form. All the non-system-preferred variations will be defined \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/variation_const.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16df9cc2ade679190e2ae6542b3d2cf0647097b00deec0b4c74c3790c4c113e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Define as extensions: \u003Chttps://github.com/apache/datafusion/issues/11544\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/variation_const.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde1163d92f19e78b7adcd568b52847a82e07215bebb2f99fb23bf0233f55044"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO substrait plans do not have \u0060last_modified\u0060 or \u0060size\u0060 but \u0060ObjectMeta\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":"datafusion/substrait/src/physical_plan/consumer.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9650d80d75f1750abfb5ee676a858e48cf6f72357fcf2059e5ae508d67a44c95"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: duckdb doesn\u0027t set this field, keep it as default variant 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":"datafusion/substrait/src/physical_plan/producer.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ce5b2e90aa7b2ba8f2804bc2d70ea7b30f1fd739faa0b52cd1bda59eed35ba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: duckdb sets this to None, but it\u0027s not clear why. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/physical_plan/producer.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"91767f6cf086a66cc84466f22086e60889c5666035de2340454091ee12d35e75"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: duckdb set this to true, but it\u0027s not clear why. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/physical_plan/producer.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5bada8e219ebf324c1e8370c1b3cc8ddf03bfa18e6ec0f386294eac3ced045"}},{"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":"datafusion/substrait/src/logical_plan/producer/substrait_producer.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa3283ef62855333cf615be04630faed13daaf6de076cf63571f8296f6b1902"}},{"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":"datafusion/substrait/src/logical_plan/producer/substrait_producer.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"185c50f7df508fee879eb716a978fbea1a0603b8678249b622cab99452644e71"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support range repartitioning in Substrait exchange output. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/producer/rel/exchange_rel.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac16814245105b1e19244e5a14c79b95263626667dd91c7bc39453cc48a0a6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support range repartitioning in Substrait exchange output. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/producer/rel/exchange_rel.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d60e1d4a6d50a3db03970a4811fd32262e0c74dc9558a186242f4bb5439db5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support GROUPS \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/producer/expr/window_function.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"601ced3ff52dddcfaa29f35889325e52de37054ea30355a69ed4facd48aaa1d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove these two methods \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/substrait_consumer.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffd3e4ef2b4baf83c4e5ac5f8da37b1be1fdea8e3b09ff5b3c744602fd45489"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove the code below once the producer has been updated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/types.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6516e25ba2df999b9ebd3a7901fd031a8fcee12c77cd6809ce12f79a734fa43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Check nullability for List and Map fields. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/utils.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca10cb2a4bf9d63c81d9de822d8e6821d6b90e7b5a0402b7e1a93c10329040c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Add support for List/LargeList/FixedSizeList and Map fields. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/utils.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba47cc5443cd47735b467a5f8fb8be80eb31d043123b105608ddf2349243d6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: currently does not support multiple local files \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/logical_plan/consumer/rel/read_rel.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"44248b7fcca0b675010b7660f04e337a14eb86eade061d53336db305e81e2d5d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hacky way to  find the \u0027filename\u0027 in the statement \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":"datafusion/sqllogictest/src/engines/postgres_engine/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afac7608ba8e867a03342fc3ad2077571107b35c0e69fe83404d1946c3bc0e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add test for having in execution \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/tests/sql_integration.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e03717ccc88d36b5affa9140e61135b41a288445967ce0b6f1d50ca2baad68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: for now we are not detecting prefix of sorting keys in order to re-arrange with global \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/tests/sql_integration.rs"},"region":{"startLine":3661}}}],"partialFingerprints":{"codehealthFindingId/v1":"779db6f123e3845f62915db16969f2091ae54836bdba813561c51def5bb877e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: for now we are not detecting prefix of sorting keys in order to save one sort exec 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":"datafusion/sql/tests/sql_integration.rs"},"region":{"startLine":3764}}}],"partialFingerprints":{"codehealthFindingId/v1":"a423b89f7b16eafdcb9459ac4a0a3df4401193cd6263675d6a16914544dd5c88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this sql should be parsed as join after \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/tests/sql_integration.rs"},"region":{"startLine":5074}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bf0f6b294147291b35b1c1b1e9f67d44845d18ebbb193be6f3468ae633afc3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: change to to_string() if all the function name is converted to lowercase \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/tests/common/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bad4fb35cf3ccedf8f906d12d446f560b97cf523318c211a4824d9dbbb261e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: change to to_string() if all the function name is converted to lowercase \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/tests/optimizer_integration.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"122b59927774189a8d04e6ede618320533e345693373b76f580e7e6cb9fd2e72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Change sql parser to take in \u0060or_replace: bool\u0060 inside parse_create() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/parser.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d93776ad6f096efdbc98830e5312f38f107e25240909b0f4e62b3c93de4489e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It might be better to return an error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/statement.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"319682432b0e30defd8d72a1c07601dcb0e42431f40a42731c4ac8c94acb11d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support multiple tables in UPDATE SET FROM \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/statement.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1dc4ae23fd11c2944d3cd5845b2cfe41e820ed9da723917e2108f600ea15cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO fix https://github.com/apache/datafusion/issues/19950"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/statement.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9068508453b3ad9883fb32ce5ed1f414510c5e9c47db6b9f28f3c7e2fad881"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO fix https://github.com/apache/datafusion/issues/19950"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/custom_sources_cases/dml_planning.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbdbf5d9712be0b197e4903d4d21bffb9e50845189bd4fe9fe6d01b2481843b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO fix https://github.com/apache/datafusion/issues/19950"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/custom_sources_cases/dml_planning.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"8050bc029b83056523f899758e3e36fd4051f4e87726b6d97ab7db7a7a7e2d1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This can be resolved after this issue is resolved: https://github.com/apache/datafusion/issues/10102"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/utils.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42f159cde896a18b44befa1061abff540b1f74cf8f384b443740a42cbec8c57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment repeated across 11 files: The identical TodoComment appears in 11 files (13 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 13 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// TODO: remove the next line after \u0060Expr::Wildcard\u0060 is removed\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/utils.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"96df9db08983db562251de42444395d11df47ce76f0c6d0f500d753f3d4250db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unparsing wildcard addition 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":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cff59d959d78c5384400ee33126a0d3536712968339d098c77ebbbf865a4c08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support for the construct and access functions of the \u0060map\u0060 type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6e6bf5203c42b812d48045d7383099d9ae1feb1a884420694e5b467170d5ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out if ScalarVariables should be insensitive. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/identifier.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"36775856f06bfc8e94d77db9dd35e23246a8159ccd26fafe77ad30af6b7d674a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this when we have support for nested identifiers for OuterReferenceColumn \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/identifier.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7524d6f84f1b5309472b615208d62d2fc1b188a5651a6da6f4d417a659ae34ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This branch is shared by params from PREPARE and CREATE FUNCTION, but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/value.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff06121d5f505ba3f23593c8b02a0cb891c5b16b02618f85d2527337a67ab13"}},{"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":"datafusion/session/src/table.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"1489fb5780a8fa6cb8fa083cc9c072d1159e24aa4ea05e02ae225c46e1228516"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Handle ILIKE perhaps by making the min lowercase and max uppercase \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":2250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8908e50b3187e163bc8ef0462a2f7ad55711c8f2f509cc26a47531b25c9c5aeb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add test for other case and op \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":6908}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d0e384de33cfa963cf2baa90bd0ac6e609c4f8b3a6f1d80622a0a91eee55b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add other negative test for other case and op \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":7000}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59ed109339dfa381c797e2441a6ffeb5b2131ba7576769a6ed8d09a450883f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO refactor other tests to use this to reduce boiler plate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/pruning/src/pruning_predicate.rs"},"region":{"startLine":7442}}}],"partialFingerprints":{"codehealthFindingId/v1":"985ffc22cd483e25636fe9977e6d04ab7650ae428b00f032287aac4d70775924"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Revisit this workaround once the Arrow dependency includes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/pruning/src/string_in_list.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1c41265a0045826363530d081249940eced766569c5ea92ba0a71c3a83cc3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove extended_schema if functions are all UDAF \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/physical_plan/from_proto.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6f119c7d5536cf8eb1bc58f0946e6a1ae54886e9c779d17afde3b7645d4786"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove extended_schema if functions are all UDAF \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/proto.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e7dca81b7d14cf91634a0c4fc9dedbfaff5817fd352996de4a3e26eba1ba11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! This is a placeholder for now and needs to be implemented for real. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/file_formats.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bc9f94e6c9fbc65e43c0f392127560fe17e9352cab508441d88d1a915ea4f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! This is a placeholder for now and needs to be implemented for real. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/file_formats.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1084a52efbb2f75d026bbb40191e87825370fdee046d5ae46f79d97f820738f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! This is a placeholder for now and needs to be implemented for real. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/file_formats.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2538692f211f428d650b207b387043c1c36e33993e8eb3b2332274d83da7e4cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! This is a placeholder for now and needs to be implemented for real. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/file_formats.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fa6ad3be5974433202811846689e5e7524179c0bdf513483689017ffc5fb91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO! This is a placeholder for now and needs to be implemented for real. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/logical_plan/file_formats.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91ae16ab17cfa8e1e66516c9672c6e9e3082f01207c2e533002994923c960e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment repeated across 19 files: The identical TodoComment appears in 19 files (25 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 25 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// TODO: collect info\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/analyze.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd96b1bba2b816123e2f81cf5be0e844db9edfdcd67399b1b749583b060a4cb4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use some sort of enum rather than strings? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/analyze.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cca0cbebca2b73007872a94528e8501a17b63ad6b38a98965f4fa6abf12db66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make this more sophisticated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/analyze.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b68dca4820e77dee9d7a8525d50842ed95e8ac61f1fe576aee46525cb558b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Track \u0060elapsed_compute\u0060 in \u0060BaselineMetrics\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":"datafusion/physical-plan/src/async_func.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae2011e042794cce007ca9160c4c3500788bda4f03bf9cbb8a166d4feaae677"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is there a more elegant way to overload cooperative \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/coop.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"190590a1be4c078e6b1af9896e155d33f137fe39e826fc5a1a91c66a2325c26d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make these variables configurable. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/display.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"363a39ef9d8850b29d711b365484c38e2aedc6ff38cddbd56595ab1c262a3ad3"}},{"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":"datafusion/physical-plan/src/execution_plan.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f450e06f7e8ce347c048be54f1f67414a89b43365eef6a71c95c1236b64aa4"}},{"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":"datafusion/physical-plan/src/execution_plan.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bdc93c23f8374fb4d297b5e5e030fee0bd5825537bd584fdcce2584596979b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with [join_next_with_id](https://docs.rs/tokio/latest/tokio/task/struct.JoinSet.html#method.join_next_with_id"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/execution_plan.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f64a2cb762253f0c7f0fb76f910f38c1a919af8d7cc5efd19691279f33393d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: support multiple partitions, see \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/materialized_cte.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a42fca7c246f065152a5af832f0c8229ddfe20cb102d4815936a419c24e31e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: remove batch_size, add one line per generator \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/memory.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d40cfbcaf0cd6fc757a32e5c50f2fccd6e8b1052026991c13b385dd9120e92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: control these hints and see whether we can \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/recursive_query.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa52ee873906d74501408905dd73490cd5b64666cc3bd594dba64fa2de8282d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we might be able to handle multiple partitions in the future. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/recursive_query.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f818ee2c22cdbf3a5e8a7fd0332dc562620770df7125d73f7ae06e0fe8dde6dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It\u0027s never used. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/render_tree.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"08978444dd6a0b43498b9fbc4f1a137f6862cb3e9dc8d19d37c2bce8f87ec413"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Consider overlapping computation of the subqueries with evaluating 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":"datafusion/physical-plan/src/scalar_subquery.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0513e4b96c0e6c07a1e335fc9edb0671acbad4d24420a52b585d840a44581afb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it would be better to apply it as soon as possible and not only 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":"datafusion/physical-plan/src/work_table.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5102333f92013e369bfa0cf52054a453d7ed32405aa277e5cbf5a6cfe9206681"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: an aggressive projection makes the memory reservation smaller, even if we do not edit it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/work_table.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91b66aa790f64c52ab9f7ec6a519fa5fdb4e62e762e27de860a5e611ed10ec8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Emission type and boundedness information can be enhanced 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":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de05ec70a61efabebb8730ea2e9bafc1bafe5c908255c4d651f48979d65ece5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Emission type and boundedness information can be enhanced 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":"datafusion/physical-plan/src/windows/window_agg_exec.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9ff5b1238483a7c4251c8c29640cdf2c597b314341867047ff5d4167cd1c67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Emission type and boundedness information can be enhanced 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":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"28400681bc4148df6de2992dca6c9463632da81e0f221d9057c7d2e1afb963e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO stats: some windowing function will maintain invariants such as min, max... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/bounded_window_agg_exec.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a18c0a059aa9d17de1e88f662dfde758a2987149531a71ea9de9ea19a015500"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO stats: some windowing function will maintain invariants such as min, max... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/windows/window_agg_exec.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a207ca4cd627928528ca6bb2cb4fc852f1e79d3e63f6a4aac8849280ad63dae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make a builder or some other nicer API \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0464fa6708013584fb5e92ab00b863062f259d724adbf31a0313a7c22931c199"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO there is potential to add special cases for single column sort fields \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"827f66e3450c1f36e1f764f37bffb4c327017b9f72f2d6e36172842f64370bc2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO PartialOrd is not consistent with PartialEq; PartialOrd contract is violated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/topk/mod.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53dcf4bdbcb80e89fb641e7b1d3b9a65560436df0cabb1726ff7310b7f711b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - add a threshold for number of files to disk even if empty and reading from disk so \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2557843f8007b960b7a8c28c2f9f90aba59ae0752460b4e412dfda19ba0ae590"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - We can write to disk before reading it back to avoid having multiple streams in memory \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"209f697d054107ae7d69ff310e88d67703c60879038f0245252d99e75102f65f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - avoid this hack as this can be broken easily when \u0060SortPreservingMergeStream\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":"datafusion/physical-plan/src/sorts/multi_level_merge.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8b1def1623f4c8a690e9e375e61fc34af82484cf3714c4723ab52078bf173d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make a builder or some other nicer API to avoid 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":"datafusion/physical-plan/src/sorts/sort.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5b56495bea36774767e153d49d93ebe3e0a974b98e12ab432e9520345f41e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support range partitioning and OrderedDistribution. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sorts/sort.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d686cb4d8314e4a4c446d9dc56210864ae9eb8f22b6d5ac86e28971895ef04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pass filter.expression_analyzer_registry() once #21122 lands"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/operator_statistics/mod.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f370c43e54535b348743763cc836c163eb5afb271c5eab32b8dd8ebbe6cdf9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pass proj.expression_analyzer_registry() once #21122 lands,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/operator_statistics/mod.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"816401c3dfa96985bc8e899db5978997dbef88bd00bd202bce4c860afdd35ffd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check equivalence properties of cross join, it may preserve \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/cross_join.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5378f76d6282d5537f0135bb7f3d73cbc45263fa26e2dec48e187f94e4e483e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Optimize the cross join implementation to generate M * N \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/cross_join.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffded55bf2a0b5624f671a4d8f3a496f86cfcec1fb5c66ce668126dc59b8166"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: currently if there is projection in NestedLoopJoinExec, we can\u0027t push down projection to left or right input. Maybe we can pushdown the mixed projection later. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf328975029ace35f0b3cb85854444eb15455ba8cd4b3eaf824464d50f465c2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK for the doc test in https://github.com/apache/datafusion/blob/main/datafusion/core/src/dataframe/mod.rs#L1265 \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":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":3295}}}],"partialFingerprints":{"codehealthFindingId/v1":"52590094dc43ab10893a8206e7f476ead5f8ebf4980f916d701bafe36693bae1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): since the output might be projection of right batch, 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":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":3992}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a99102173bf0de2755cb4857a566bd5e0540de7af68b5460a286fcf6d33eb53"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: If the left schema is not nullable, the full join result \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":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":4190}}}],"partialFingerprints":{"codehealthFindingId/v1":"00726726a34e098ade7520151b8ef379aac6a01d855a4cd73cd5b60220f8a8b4"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to deal with the borrow checker \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":"datafusion/physical-plan/src/joins/nested_loop_join.rs"},"region":{"startLine":4270}}}],"partialFingerprints":{"codehealthFindingId/v1":"590e3b5d1471b346ac57044ce12c5949487c446a3b12b77ee24977165663e595"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: switch to using [HashTable::allocation_size] when available after upgrading hashbrown to 0.15 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/stream_join_utils.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8273e1a79b05301ec256446c50d99471c8b22f7b280c11f11c76420de670168"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: sort merge support for right mark (tracked here: https://github.com/apache/datafusion/issues/16226)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/exec.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4762a57b30d7e48205bd175d729891b84215e94244aa26acbeaf2f68b34f1f64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Allow multiple left partitions by sharing the right-side summary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/exec.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c10a83764789153bf8c1d224f8c559add1f686fd63b49a4beabffd9d6730013"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO stats: it is not possible in general to know the output size of 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":"datafusion/physical-plan/src/joins/sort_merge_join/exec.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"37549a2b409a31efb1a69b6a0e44fd0b9c49a33d9235488b9894d83f356ecc12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Spill join arrays (https://github.com/apache/datafusion/pull/17429)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/sort_merge_join/materializing_stream.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e258bd94cde5e858dbde69acb2fefd70c4aab01c07d3729675e87a620fb827"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add input order. Now they\u0027re all \u0060false\u0060 indicating it will not maintain the input 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":"datafusion/physical-plan/src/joins/piecewise_merge_join/exec.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"771706c522c8888dd244c02f5d11714ab98f657aee54b0f5c285f47f55d163cc"}},{"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":"datafusion/physical-plan/src/joins/piecewise_merge_join/exec.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cae32d5ef10f8243ee838c1cb5b8b5b002529b443fac974623058c5dbb08573"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support create ArrayMap\u003Cu64\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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa65b5da65c13f13f4c722e3d734da72723359fea50d3d1dbde938b949965e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: currently if there is projection in HashJoinExec, we can\u0027t push down projection to left or right input. Maybe we can pushdown the mixed projection later. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a3edf587cefe9679823eea42a9cd0d0dc8af2e3bafeb1bbcc7c62140d4db83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rename to MapLookupExpr \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/partitioned_hash_eval.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e34b21f6f0cf90f2f95c69694756c60fcb9eab0ddf73b6eb5b3fa2d757b53c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: include the link to the Dynamic Filter blog post. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/joins/hash_join/shared_bounds.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f1ceb947986a66f2babb374439fd6dbd03f80e50f8c30723637f464099df3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Make this a member function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/aggregate_stream.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2b7168fefffd16dfd3b9e03fd5d5ca23490b0d3724986c312605f802581115"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Full group clustering uses a non-spilling execution \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":"datafusion/physical-plan/src/aggregates/clustered_final_stream.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d919be7804986093cec893fd59ef2469349372417b1b7de2b477a989df96b28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO stats: group expressions: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"45004e6354fb6c8bdda0d337094a3958b8089b6d185c712cc6924fc0ab88c3d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO stats: aggr expression: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac2362c923b1369ed2ae2273e56c8d4eb8a9f36898f851450f783aece4723d1"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Should check the function type more precisely \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":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"dede7df5cb794cd30543c417951d78959d7fe227640c4b0530c4d5a150b165b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Derive safe predicates for expressions such as \u0060min(col \u002B literal)\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":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9f1384eb15e52d90225f8e0b2db958da6663bc78142fe5c3f1dbf149280e58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do debug_assert 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":"datafusion/physical-plan/src/aggregates/topk/priority_map.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cb1b29a9f1fc2f9272fe734826934a30ee07c892469eb35cf6c4e353d3dc8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it would be great to use something like \u0060set_bits\u0060 from arrow 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":"datafusion/physical-plan/src/aggregates/group_values/null_builder.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9332944bef5456a558a08c8441f1e61b4d61a3e7dcbbcbf7f2415f55066ae3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO file some ticket in arrow-rs to make this more efficient? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/row.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b3036856c4cd541c6c1400c5da75fbcc65488f4f9ff98b1e24a6ba4b14f599"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Materialize dictionaries in group 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":"datafusion/physical-plan/src/aggregates/group_values/row.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"779487149335eaab9567ceb6217ab5355991d96f8b9b673566709e5dde3739a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Materialize dictionaries in group 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":"datafusion/physical-plan/src/aggregates/group_values/row.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ae50bd9b95eee9473fccde34318652dfd3c8fddb42e51bb248d2b27a393d2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Current approach copy the remaining and truncate the original 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":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/bytes.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c636286b94fd0a296f040a35319cb3583173548b4e45593e78860ac05162a0b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: this guard works around \u003Chttps://github.com/apache/arrow-rs/issues/10413\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/row_backed.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5645e006a29af6754e018b58a31acc670ff1b0e47223a9bec8dce810029bb38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: mirror the arrow-rs efficiency TODO in \u0060GroupValuesRows::emit\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":"datafusion/physical-plan/src/aggregates/group_values/multi_group_by/row_backed.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b772e0b285d38050244bb3be86784f516906e2603877c47a43ba1af24148a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we need all aggr_expr to be resolved (cf TODO fullres) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/aggregate_statistics.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83b750fb4a150aa7539fcd1c42fe67a62be70e17f80015fc5c35ddc942b5f8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO fullres: use statistics even if not all aggr_expr could be resolved \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/aggregate_statistics.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d27d3d22f4633e03041dc791d767461b0dcf1322bc8acd15878f747cca1d03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: by calling \u0060handle_child_pushdown_result\u0060 we are assuming that 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":"datafusion/physical-optimizer/src/filter_pushdown.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1e239a43faf8ed79dbcc5e60eba46c5b84ac9221dd3ad76efb2bd4081ec0e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We need some performance test for Right Semi/Right Join swap to Left Semi/Left Join in case that the right side is smaller but not much smaller. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/join_selection.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84c478851959449d4f3a14271a0fe96b2aa89ae9d5993d5b9f954159d1c122d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In PrestoSQL, the optimizer flips join sides only if one side is much smaller than the other by more than SIZE_DIFFERENCE_THRESHOLD times, by default is 8 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":"datafusion/physical-optimizer/src/join_selection.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ca346dda0505151b2561faa556feeb5d860846c4471487a7517800290ef47f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060try_embed_to_hash_join\u0060 in the ProjectionPushdown rule would be block by the CoalesceBatches, so add it before CoalesceBatches. Maybe optimize it in the future. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/optimizer.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e4632f3d1df3f05f7275bd0e9f67fca324b5b714657a1f892e61b83318ff04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle the case where a prefix of the ordering comes from the left \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"628fdea4094546eccf16efb533141a7d095cadad1babd1302fcf588ef62c7198"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle the case where we can push down to both sides. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"834dfda13afdf7c3c9ac5c7c42a6d74e1a583445d83e0ee854adda2e68347d0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make SortOptions configurable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/datum.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"53efa2e073c56f3aa4c665bf6f38b2576b1b0cab0bf154ac64e7b2fb607b8310"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace this assertion with a condition on the generic parameter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/sort_expr.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac07995b6054faf6006e0ba0ade659e71024f0f592f453141db5542e3f75cbfe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace this assertion with a condition on the generic parameter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/sort_expr.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"3141e92bde0f000315065ff89c1d0194fbfe582cae4f171500cd590dba02889d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add optimization to move the cast from the column to literal expressions in the case of \u0060col = 123\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":"datafusion/physical-expr-adapter/src/schema_rewriter.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdae3307dcbdd910ff533b6b44fbd74f6d9bcf2df5acf4483fd2c86b1024a810"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: need to align arg_fields here with new args \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/aggregate.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc73a3357ca7951f049d9f41a5bef8b3fc30334e4736bf04f31d08fa98ce12b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Human name should be updated after re-write to not mislead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/aggregate.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f119cef47a03645fafb5657debece20d0bfe8514df2bbbf60e2c2fee733fbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement this for scalar value 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":"datafusion/physical-expr/src/async_scalar_function.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a636fbeffddfcdedb83d574c56f4a8e77eb6a20a5aee52c63921e1b8824ce5b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this makes a deep copy of the Schema. Should take SchemaRef instead and avoid deep copy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/planner.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"af948258ee0b0c9a20160377263874d99dc3e769cbda216cccab75a79f0380a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: for above case, we can infer a IN (2) AND b IN (3) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/utils/guarantee.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ec29e5d3390793510d5bc98ed29a281efec1ec560b2447a6226ba024ba688b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should be \u0060a IN (\u0022good\u0022) AND b IN (1)\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":"datafusion/physical-expr/src/utils/guarantee.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab44d9ee8dd34ea2ecd56c9920a911472b048d3dddb4df3a2cccf46c38d2ba1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should be \u0060a IN (\u0022foo\u0022, \u0022good\u0022)\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":"datafusion/physical-expr/src/utils/guarantee.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a27da1930e945917305213f03169fdd4e49268ceb04f9ee3a4554d3b3f089a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We expect nodes a@0 and b@1 to be pruned, and intervals to be provided from the a@0 \u002B b@1 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":"datafusion/physical-expr/src/intervals/cp_solver.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7260d4e76cc9f732a47d351dbaba3b8c9c529cb947dfcef4efeb9b74f0d180"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: There may be rules specific to some data types and expression ranges. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/binary.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c280f9e243295d6cb0dac3221e7d9ebe4d2b4eddc6e735e14a9560583fca88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: now we do not refactor the \u0060is distinct or is not distinct\u0060 rule of coercion. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/binary.rs"},"region":{"startLine":4921}}}],"partialFingerprints":{"codehealthFindingId/v1":"7492a18166c5483b9352189c4968e26fa212ac640841c01dc2232c4ae30ec1ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we should add function to create Decimal128Array with value and 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":"datafusion/physical-expr/src/expressions/try_cast.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99b06d0dbdb1369029dfaac5ef781c9d5d606aaa75f0636b9da6e3a701da9fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO - we should think of unwrapping the \u0060IN\u0060 expressions into multiple equality comparisons \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/case/literal_lookup_table/mod.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"476be9de13e5fb145d5b409bf4ce48634f234272063e4c40a7c32dc6eed3b34f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - We need to port it to arrow so that it can be reused in other places \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/expressions/case/literal_lookup_table/primitive_lookup_table.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6026857e9404fdcf235270280e8bd03e73edb1473682fca1dc88cd0f0e17c111"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The \u0060ConstExpr\u0060 definition above can be in an inconsistent state where \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/class.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b43842fb33ce21c19a3f58587c4554e9536530c64b69a13d53a5fbcaec3c36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return an error if constant values do not agree. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/class.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c0c23a3cd545628060fc1ba677dda2430ff0cf858f9d125de3b0cfd9cd7761"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return an error if constant values do not agree. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/class.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e327f70e44287c68d7dbe21244a1cabeeeb5b6178154b6faac5e49a9b6ca6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return an error if constant values do not agree. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/class.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc85bea0dec76a7de9e8999bc9f9ff8818b7e7fce23da10cb397925889a7ee6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This function should be able to return values of non-literal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/class.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1abaa87c4fa66c1cbd48a2f4e7ad21547485381d2a7bd99f00e6d7cd493bc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If we know that exp function is 1-to-1 function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/ordering.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0e8aada64d64b346316e23caa47f1bda3b914868a0ed41e385c5abcaf3b025"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If no ordering is found to be redundant during extension, we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/properties/mod.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"0005f62f99087ec712e89af46275f17fafb84781e647ed39f4260ccc2dd2acee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Handle all scenarios that allow substitution; e.g. when \u0060x\u0060 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":"datafusion/physical-expr/src/equivalence/properties/mod.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8714487eb335759a387a0cc6f3d330449d1af639991e7a6934738516afd4ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In some cases, we should be able to preserve some equivalence \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/properties/union.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89540b27370c954a4b752c7a8a3a5721ce1f520b6b53b1ce204231f23ec6f09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO tests with multiple constants \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/properties/union.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0a47d73f0b2d6a1f11e47fa73420fd74e9a3e0cd7ad30b56c07c3167682d5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Although \u0060find_common_exprs()\u0060 inserts aliases around extracted \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/common_subexpr_eliminate.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fae84e63128be9e3efa723e523fe20698405c68b8ff1fa0bc77ad0101b7fbd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Although \u0060find_common_exprs()\u0060 inserts aliases around \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/common_subexpr_eliminate.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c6aa3283a81e82ff80a09ddf559bc5d8f93dbf687c088498166f9da33c4750"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there\u0027s an argument for removing \u0060Literal\u0060 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":"datafusion/optimizer/src/common_subexpr_eliminate.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a5de95f305ec4e966e90d60d04fa1f385b57d9c02e3a7d36ff5564f317238a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support HAVING in lateral subqueries. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate_lateral_join.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a33fed9d0f87d3cf74ba844face57cddfc2d36c07610730f2265a359e364c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#24960): stopgap until count-bug compensation covers \u0060IN\u0060/\u0060NOT IN\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/decorrelate_predicate_subquery.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4a8322865761817f75d6a48bf1c03bc1dd78b3d2fe457694f08fa381ab9e18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix this long name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/propagate_empty_relation.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09ff58d4f8611f02d52e76aee465b37cbef7745678d84853f7416ac41a44b44"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: In this case we can sometimes convert the join to an INNER join \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/push_down_filter.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"252fb94048160f019841a6296759c22008b082f27143d2caf6804335ec1fc5dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use LogicalPlanBuilder directly rather than recreating the Aggregate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/replace_distinct_aggregate.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ed79209c54fa2480c60fd2f6f12fc5f92d728c9bcb8940fe0331f31a91ae23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle escape characters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"f245698d90642331aa92a4a924879bc503f2ff3978ca4c49b6684cc10adca7d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We might not need this after defer pattern for Box is stabilized. https://github.com/rust-lang/rust/issues/87121"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa479905f8c5d5636c50f0483b0030c9987aa4272815d0d80e7df5296c39a640"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We might not need this after defer pattern for Box is stabilized. https://github.com/rust-lang/rust/issues/87121"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"67320a2a65e93661f8d8b8d45ea70c8838c145f2b4a2f7894c0b98f429854c51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Further simplify this expression \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/simplify_expressions/expr_simplifier.rs"},"region":{"startLine":4867}}}],"partialFingerprints":{"codehealthFindingId/v1":"8774b9f0f138ceef7b35c478f220630e95cdb31d495b2fecb860f9ee75f0fb77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For some subquery variants (e.g. a subquery arising from an \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/optimize_projections/mod.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba1793ebce2a57b582b5748aa369e0919ac56d2630c424b152028d7aaed8610"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add common rule executor for Analyzer and Optimizer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/analyzer/mod.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7c935d4338c86492fea08fc9a6f99d8bbad28a8da31920607a12c1aac854d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Do something better than name here should grouping be a built \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/analyzer/resolve_grouping_function.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f595bb747d4b25846840fba0e33342eebe0e354567393b7b4a1c865803b644c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should cast col(a). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/analyzer/type_coercion.rs"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"979b52c1a46860f400e6982df5293755236a71deaa99f38bf512b0b5471a297a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: change the original arrow::compute::kernels::window::shift impl to support an optional default value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-window/src/lead_lag.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50bb9e86360137f79861dc9017da0eeed75edce325c931e6b0206c128b10866"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: should metadata be copied into the transformed 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":"datafusion/functions-nested/src/array_transform.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5e84f957ed1d63d9a8adc31226cc7a90b354287b31a5d970c5354833d8d42c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: concat function ignore null, but string concat takes null into consideration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/planner.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7193971737d92d4bbba498f5b0d5b0f045aec5c94000254352f8132e616977"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider switching to a more efficient \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/string.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba90a6c9d9e7e83bf3393d77c1a72c21143bacbcd92858bdd55a0cf076b7416"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Ord/PartialOrd is not consistent with PartialEq; PartialOrd contract is violated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/merge_arrays.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd343fdc67cfa26faa8ac306dc5fce6f4c21e5a1b7da4f6be7870f3547006df1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Move this to functions-aggregate module \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/stats.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87ee7f210c559766e526bedddab2d97b8d9d3fb46f22b7b8b1650eb9adb859b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // iterator. TODO file a ticket \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"775089633d907aff24e63dba3bd526cf88b14b288d1179f14051a54a0866ac60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // iterators. TODO file a ticket \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/accumulate.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ea4a09a0287d50e4060579f335924802fc727d915343d67937b4a38bd4a018"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: replace when upstreamed in arrow-rs: \u003Chttps://github.com/apache/arrow-rs/issues/6528\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate-common/src/aggregate/groups_accumulator/nulls.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6259dd29e1a6b47af75eb26b1e5b1550fca7a3ef048bb15fa887aff1211e7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is arguably \u0060DistinctHandling::Insensitive\u0060 \u2014 the accumulator \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/any_value.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8e375058d878e631904eb2bd50e62555dc6e93b6654933b7c75c57f392b8bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: null input skipping logic duplicated across Correlation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/correlation.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbee0ad87f7c5ca6b1d0e768bf0ecfc8fc5f910e180608bf807821581bd972b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO optimize with exprs other than Column \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/count.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6c0bde5e70465b648c7cf2cd7b3ea48efe202bce7c091c8d04899a1b6a6f46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO optimize with exprs other than Column \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/min_max.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdee3fe31ee1c64bb0b0ae85d1546c4e034db707d7349751ccf2191515667310"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: whether this is \u0060DistinctHandling::Insensitive\u0060 depends on \u0060ORDER BY\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":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5b70f83dfe97aa58fadd49ed845090b9c86930fe19a68c21d6bf2f6a896165"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: whether this is \u0060DistinctHandling::Insensitive\u0060 depends on \u0060ORDER BY\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":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70dbe14442a3ce88f11b2dd2d048e8e6b6db1ca34d7421ccd845b6c3e097f63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add checker, if the value type is complex data type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/min_max.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a924bf141ff2050bf6b8285e7e2660ee567aa9996157dae3d4571173562f8a52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add checker for datatype which min and max supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/min_max.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"43711647f651fe9c45d06c73d91202b2ffc0724c709cc241cbaa6441eb42e529"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate size of each \u0060PhysicalSortExpr\u0060 more accurately. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/nth_value.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"2089365b924e789394655d4aee851e7e04ee0c28275f131cbd3757ebb6c71557"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Expand these utilizing 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":"datafusion/functions-aggregate/src/sum.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51ce002a18ae86287a2bff9b1626815bccd36fe9a4af207abd663e126855dd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support other numeric 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":"datafusion/functions-aggregate/src/sum.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcd0b1d2fe4666b823f150caa29a966fc1b8444eb2820df79ce0aa4dc151253"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: can be simplified if function has specialized \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":"datafusion/functions/src/unicode/substr.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2828ebbf98506288f4edfc7d8dd7ed7771b69be90e5b7aa97f0e8ccfb99c433"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement ordering rule of the ATAN2 function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/monotonicity.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"eece63220d9c4bf7ee636f2f389628d836c7413812397b041a366a843cff110a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement ordering rule of the ATAN2 function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/monotonicity.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc206dd787a1ca44189064e6c646b1e3ac0731527c9f4962733e9ab0313ca1c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement ordering rule of the SIN function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/monotonicity.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4c044e7021736a86cf7f3810e2aaeb2d3dede3433e0a1e36868228f13554b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement ordering rule of the TAN function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/monotonicity.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"0392304081464ddd1df0cc86fcc72047cbe856ea02b72eaca7414e5daaa5941f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could we be more conservative by accounting for nulls? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/encoding/inner.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32dbcf90478c0cb48ca0090314d762a2479124fa3133805bc41e6171c839f35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     TODO (my next PR): without \u0060INTERVAL\u0060 keyword, the stride was converted into ScalarValue::IntervalDayTime somewhere \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/datetime/date_bin.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba25d253f26a78d33cae3026be1fbb9b2670c5982727699f532f759601fca6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO it would be great to add rust version and arrow version, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/core/version.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fde0194d18bfb1d3fcf3903d75a35ed4c82d0a354e09f0320211a7389a3383"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tsaucer) It would be good to find a better way around this, but it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/udf/return_type_args.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea21f702ecdbe89d47b52fb1a6377dbbf460b5679bae3af5b34872c524606df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add retract for all accumulators \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/accumulator.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c6027bca18b797d761052b8f767e50cc6d98dd79160bf580283378d800faec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Only try for integer types (TODO can we do this for other 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":"datafusion/expr-common/src/casts.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bbf3ce09891531aabc8af394bd501b17502805be2110c0d88c8570eb58ad8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// **TODO**: Once interval sets are supported, cases where the divisor contains \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edf748b01d508441f59583c350bafc170d4d341d7b2748ac8d40afcc9c983cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add tests for non-exponential boundary aligned intervals too. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/interval_arithmetic.rs"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7a91e10c68076d89c41d4f6b42b1230de1f73e8de001ebc83573606f197df7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement for other 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":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9ede1c98933708c423922e142d2711b0825172b1bbebc09d8c811dc33ceb70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement for other 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":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6edd5c62f0e62bfabb7fc349c1ff0941505a69fd841a874214f1a549b42f08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement for nested 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":"datafusion/expr-common/src/signature.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92ad450a0c9ffcd9df380dccacb1cc7facbcca964d81d1ce73a64512c7f016f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we ensure that this always returns a real number data type? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5eb17b668b30a7e7556c7cdaa031ae9ee12d4a39cad724e7900170e5f5ae09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we ensure that this always returns a real number data type? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"affcff4cb310067b5746ede09a83e251f952b53dd974c6018586a59eeadb5ae5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we ensure that this always returns a real number data type? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8eb53fedfe98570cafe2ecc318a1c09e2b88868d5b96cf12b15ce18cd300187"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we ensure that this always returns a real number data type? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acd01ffbe68bbdd7e5c376fe169295dc510598dcfa122481e67e0f46c0bdd12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we ensure that this always returns a real number data type? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"84acd45095551a913d259c7a5f37ac326d5a4cc4fe998f9804400cd951f3f595"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We can handle inequality operators and calculate a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3776b1f71ffb829f98425d6d37a4c4e0cd0c7f90223c02790247a3590391d0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We can handle Gaussian comparisons and calculate a \u0060p\u0060 value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"c912c383cb8f12d87e4b042518d5000d94544ba76b793c785610a8b9ae436b71"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We can calculate the mean for division when we support reciprocals, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"537c4b6a3d6e5352f37cd71cdf731edf3c6459771d8d7e88aad0edad63c9be79"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We can calculate the variance for division when we support reciprocals, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/statistics.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"69526a50cd42652a309e5a988810559d0907f6faadf484254ef2fe7e71db24b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Move the rest inside of BinaryTypeCoercer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bc03f6b892d8ae1b9f9e669ef346c2a87809e31b124b2b07f81ff62f162a4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add binary view, list view with 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":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea38dc3f64aa66a03a1c201e0450e78bf890bfcc3825dbf98fae10a2b1a380bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO if we convert the floating-point data to the decimal type, it maybe overflow. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e991876b73347f72a9d6f7d9514ebcdd590b2272f85b489502e93196492f7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO if we convert the floating-point data to the decimal type, it maybe overflow. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bd931aa928bbf037bd5096020a0985224e2fa2e1d4abcd43e919b1768e6208"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO if we convert the floating-point data to the decimal type, it maybe overflow. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f020932855f2fa20e38e521e35bb7eadb7795a5b370a744620644237dab6182"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO if we convert the floating-point data to the decimal type, it maybe overflow. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/binary.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4731d8dcc2aff311ba31612e9868df2e629424c44fcdcd16b6d0d5814200ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: normalize_eq for lists, for example \u0060a IN (c1 \u002B c3, c3)\u0060 is equal to \u0060a IN (c3, c1 \u002B c3)\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":"datafusion/expr/src/expr.rs"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5c9cf3ab514753ea5db86350d5c0cfd77eb8de41bb168b21908cfceb72f130"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: normalize_eq for when_then_expr \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr.rs"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6ca7f6faad58ae4d864afe2a3703c53ba4b64844930279062bce7bdec0a6c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use \u0022, \u0022 to standardize the formatting of Vec\u003CExpr\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":"datafusion/expr/src/expr.rs"},"region":{"startLine":3539}}}],"partialFingerprints":{"codehealthFindingId/v1":"063a42a6a8dc7a19a3d731fb6a5835728dd48c1499517dd99b9fa3bea2ce1e93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo avoid this rename / use the name above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0294a9118103c3d620e4322f0d6ef72c99b104defd8ed460185f6c2f05b3b38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kszucs): Most of the operations do not validate the type correctness \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b493dbccf847f3fdb26b3fa3223949926dd83baefec84696bcc866e97ba5346"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: extend this to listview and maps when remove_list_null_values supports it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbc0d7d6115928359cd59adac024a9cf1ab44399742a2bbf8319354a16c90d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO verify return data is non-null when it was promised to 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":"datafusion/expr/src/udf.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9911bd1ca0ffb0c1ddbe7131059d5a18b84cac6884170968005d07fd6614f5e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME use as_ref \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/utils.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f72d72bcf81a3bbb8f492daadb079f87f6d42866e12233cd429e25d9b007c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Deprecate this branch after all signatures are well-supported (aka coercion has happened already) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3aedf66761c4ef072fe4a08d1b2a7f87d1eeb99df9c1872a827481b3a3148e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support maintaining ListView types 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":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eb19debeb2167231317caa75a4340145c74d69eb64dedad66282416dadd6de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Switch to Utf8View if all the string functions supports Utf8View \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77dc6bcc9858c30f7e9e99fd6c299a528a5b2cca318024871d22ea19c16f202"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with \u0060can_cast_types\u0060 after failing cases are resolved \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a402dd8cc3d9c319090f22e0ee3c3b591edc90b861532cd29937ced84ccab5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: I think this function should replace \u0060maybe_data_types\u0060 after signature are well-supported. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/type_coercion/functions.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e8127e51b99769130b8719a54574718c57a4073b143e3297b4b8c70c0d1420"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a good way to do 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":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a15f6ce87efc23681c774c8b204e4c26a5b1b8e244bbad06c142ab6b43b3a24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should we take SchemaRef and avoid cloning? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":2410}}}],"partialFingerprints":{"codehealthFindingId/v1":"5000509711dfb59538bd1340a6bb97432fb92255fd941ddab6020491512e4088"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should we take SchemaRef and avoid cloning? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/builder.rs"},"region":{"startLine":2422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9948a98937df73c930d390390f1e2b1b048c51919a40e36d661a109cac79c55f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: figure out how to support mode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/ddl.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"304d31cb24a98ac46a2e87929432d27696217505ec4d53011669a3b6a99c867a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO revisit this validation 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":"datafusion/expr/src/logical_plan/invariants.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a00943d97b0f54b624df05946fde2f13156f891009f1bf020078d7de0b543d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo it isn\u0027t clear why the schema is not recomputed 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":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98f17576b73fc949269f04e1dae90720cdb8048bdeb191817ddfbfc43d9d42d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo make an API that does not require cloning \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15f3b7d666c82dc2b7bc65268145273d4e113142e817e39f42b525857246388"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (https://github.com/apache/datafusion/issues/14380): Inputs are still"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":3549}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a1c99c625902c3ee23429ec86e2a5e36a5883eaf14bbc56fdcdd923f26b618"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(clippy): This clippy \u0060allow\u0060 should be removed if \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":4039}}}],"partialFingerprints":{"codehealthFindingId/v1":"44df55b230fc2b0215fb96fc0b7b571c5d1a5cedb9d139c1804b13b968d648ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: may be implement NormalizeEq for LogicalPlan? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/plan.rs"},"region":{"startLine":5066}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82cccbc9163a7c6c0153bcc6c2e634157728bac0ec75bcbd30fe8fd59246f4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: a more general optimization would be to change \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/logical_plan/tree_node.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"abee348b6c479ea7c608327e01f1766a8d752c653afa8b2736d0a3e6f8477234"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the insufficient_capacity_err() message is per reservation, not per consumer. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/execution/src/memory_pool/pool.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"8543065f9950e3322707e401fe193e36f204bc7c1e3787a09e2e8436ace2d9e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO add ordering once LexOrdering/PhysicalExpr implements DFHeapSize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/execution/src/cache/cache_manager.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a0b5b4f07f57c68afc3ba61691ed0effe1612e03ddb3e39be5df935b8867c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It might be possible to only DFS into nested fields that we know contain an int96 if we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/schema_coercion.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61cbebce6bec61fcc8bda2782c0117fc998f1da656f2b95e752e6ea537fb45c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid this clone in follow up PR, where the writer properties \u0026 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":"datafusion/datasource-parquet/src/sink.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8fbecb557cfc38b47a25d4f5096013caf2a6e0cbf0b7462ed441ebb2e83668"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: split state as this currently does both I/O and CPU 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":"datafusion/datasource-parquet/src/opener/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aae868700f4c1af27aa0920f969c340ab3dc00b7a6d1508e83d117f5f6b8045"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fetching entire file to get schema is potentially wasteful \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-avro/src/file_format.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5bff054cb293adc8154170b3b275b4c73a1fbeb3371e9cd5964c36b2c1e3e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: should the file source return statistics for only columns referred to in the table 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":"datafusion/datasource/src/file_format.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8144c59e98a96fbe3e8721c7569e0a96f4d7288cd23b93da3d7300ccfb74e1b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add desired input ordering \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/sink.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"10aa7a0827b9ca7938905f19dc3ca3fb280d40adfdf1b356a4d362574c235da0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: upstream RecordBatch::take to arrow-rs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource/src/write/demux.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf783f495b6304098520a974be8ddeb1ccaae02408c1fc32b1636779b89b92df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can we put this into ProjectionExprs so that it\u0027s shared 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":"datafusion/datasource/src/file_scan_config/mod.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74d3cd843e219c656da7942aa94535bdc242c898cf746936e672144df9e3838"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: End state payloads will be checked 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":"datafusion/core/tests/physical_optimizer/enforce_distribution.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"354bbc3c9a547cf14d21849099144e330adcf622522ec8f1bcc1b33541e7468d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: End state payloads will be checked 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":"datafusion/core/tests/physical_optimizer/enforce_distribution.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae7048b3fc92c081c3f5870504bfed6a0d52b0b8011d0d6c82e5cfe975400a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: End state payloads will be checked 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":"datafusion/core/tests/physical_optimizer/enforce_sorting.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"752bd1f65897ead11d9484349a50fdddc0509974f45ebb6e77cbe43891c1ab04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: End state payloads will be checked 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":"datafusion/core/tests/physical_optimizer/enforce_sorting.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"befa4b2f43286577f05459c17f0cbf49aa09f7cb7242828d7479742b15e1f15a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: End state payloads will be checked 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":"datafusion/core/tests/physical_optimizer/enforce_sorting.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0101b3cdb496c221b35a7a1ad512974973eb5bffa8519faa631347e74088b438"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: End state payloads will be checked 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":"datafusion/core/tests/physical_optimizer/enforce_sorting.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dff28f76ca981d6b3690a8c9107add77e790fdc184416266bd00ca25cfb6c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wiedld): show different test result if enforce distribution first. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_distribution.rs"},"region":{"startLine":3686}}}],"partialFingerprints":{"codehealthFindingId/v1":"199682b81604aca1209db8bcf06ef2135247ea5ff36a6c804e49f19c319e07c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wiedld): show different test result if enforce distribution first. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_distribution.rs"},"region":{"startLine":3712}}}],"partialFingerprints":{"codehealthFindingId/v1":"826450deaed8306d2a658dae482fcced19089da095a1bb3fdee5b4ce67782afa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wiedld): show different test result if enforce distribution first. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_distribution.rs"},"region":{"startLine":3792}}}],"partialFingerprints":{"codehealthFindingId/v1":"620232d009d0e4bb6fd30a1f3a8538d1a40807d19d87ccaa2db4fa0c327fac84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wiedld): show different test result if enforce distribution first. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_distribution.rs"},"region":{"startLine":3810}}}],"partialFingerprints":{"codehealthFindingId/v1":"51616f08f2078cf0cde6c7449869146af60ff4475bc2f9bdc5fec113f0e54fdb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wiedld): show different test result if enforce sorting first. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_distribution.rs"},"region":{"startLine":3747}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a05fe78d1c5e96472f6bcdeb85058412322958025e5407c359bfb09961885f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wiedld): show different test result if enforce sorting first. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_distribution.rs"},"region":{"startLine":3765}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb0c9d17cf22a4507f1f97a14f717dfca9d959a908583ab161f307ecf9d9f10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO When sort pushdown respects to the alternatives, and removes soft SortExecs this should be changed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_sorting.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"d924fb0c65360ef1afe577db45c622dbf3e03df6694241c7f8cf683fe9f74362"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO When sort pushdown respects to the alternatives, and removes soft SortExecs this should be changed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_sorting.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec450125ce3683c27132b7d166e281c330a3cb0a478f5cb4ee83d5c1560e6b46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO When sort pushdown respects to the alternatives, and removes soft SortExecs this should be changed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_sorting.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"160425d8a8c3a719e3c179a5cf7456fa729bee56ba5f416cde87fbc7798f7c7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO When sort pushdown respects to the alternatives, and removes soft SortExecs this should be changed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_sorting.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f48fb038afcb0de124facbb6fc5cee2d59248daee07dd5be2103dad639b8b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO When sort pushdown respects to the alternatives, and removes soft SortExecs this should be changed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_sorting.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d157c094cca5e42efb28411932718740af63eb4c6b0ec42a00b5e7d67284455"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO When sort pushdown respects to the alternatives, and removes soft SortExecs this should be changed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_sorting.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b135823689f61d91dc21a33b157ca2fe33d2dbaea1e6ab05046cb5dea03d358"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO When sort pushdown respects to the alternatives, and removes soft SortExecs this should be changed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/physical_optimizer/enforce_sorting.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9d3342f7f28de2780101ea86d166b1e857eb8041a2af2f753f68ba5e18cd92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(msirek): open an issue for \u0060filter_expr\u0060 of \u0060AggregateExec\u0060 not printing 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":"datafusion/core/tests/physical_optimizer/limited_distinct_aggregation.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"711b1994c56548bb81bcbdc99c4cf1cfaceb9f0cff90a038f36287e756b6be5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Once [\u0060ExecutionPlan\u0060] implements [\u0060PartialEq\u0060], string comparisons should 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":"datafusion/core/tests/physical_optimizer/test_utils.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"06607afdd7dd0de85ffd0a9400c4269de3a067b2a23badf4b39f7ac85b2becb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo but after use CNF rewrite it could rewrite to (year = 2009 or  year = 2010) and (id = 1 or year = 2010) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/parquet/page_pruning.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c84ffc99886d09969afa9ad9cf7cb393bf408074403169c2cdae533252571b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Query fails, fix it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/memory_limit_validation/sort_mem_validation.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a242217df16f46ec7f50bbcddf53cc73653ab384d2d2c59f453918b74219577"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test floating point values (where output needs to be compared with some \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/fuzz_cases/aggregate_fuzz.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"181d622dc90a78ba69a050ef15d99ce185d1f737b59b7042604d2e8ce2ad5d2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test other aggregate 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":"datafusion/core/tests/fuzz_cases/aggregate_fuzz.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a640ca7eab776995fcaa2649ade3ab1d56af33cbe45429c67397027c4ce355f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: add JoinTestType::HjSmj after Right mark SortMergeJoin 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":"datafusion/core/tests/fuzz_cases/join_fuzz.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"415beef7c6afdf06fa51ff958ed91d4afc8dec5185bc38672e27458d98ee9cd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: add JoinTestType::HjSmj after Right mark SortMergeJoin 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":"datafusion/core/tests/fuzz_cases/join_fuzz.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa62c8e3af466d10698656ff6499e5c192db4aa357d81c66218b2984f0b7232a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: The following improvements are blocked on https://github.com/apache/datafusion/issues/14748:"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/tests/fuzz_cases/sort_query_fuzz.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"df29a12f98da455eb07baf7d9d7280d73c8ca0a735d4f0a8173854f91ab2ea84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this once the bug is 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":"datafusion/core/tests/fuzz_cases/sort_query_fuzz.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a47f98f1124c859141dc54aa51ba1694726e90a1060a158e935f7c4cc02a0e5"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// Hack: If we want the query to run under certain degree of parallelism, the \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":"datafusion/core/tests/fuzz_cases/sort_query_fuzz.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc17a91ed9665f4c90fff5d085ec0aede8422601034d179da70d290fc90dfe1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   - \u0060spilling\u0060(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":"datafusion/core/tests/fuzz_cases/aggregation_fuzzer/context_generator.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10c048e99429d851e703654bc7b5db5a3a88bc8c85cf1831557d7f2b40af228"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should be 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":"datafusion/core/tests/execution/logical_plan.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"61593cafced2502bda7d7f459649365b90796c50c0d69efae6a080778621a0c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO stats: knowing the type of the new columns we can guess the output 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":"datafusion/core/tests/custom_sources_cases/statistics.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8735cfb6c54b92197cf6dd8a65fc82d7b1d962bec9af2d70ef2841d107435ef6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can we extract this transformation to somewhere before physical plan \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b773d363efe5de4bb86388b8e41c6eb9fd9d12b03f51780e1c9e1272e0261d34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060num_range_filters\u0060 can be used later on for ASOF joins (\u0060num_range_filters \u003E 1\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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4b79c41eb317dfe2df3e67c78923120cbc8cf5c8c23779c7fc51f1c008e70c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Want to deal with \u0060Expr::Between\u0060 for IEJoins, it counts as two range 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":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d923ea56e6bf0c1cc9931f9a1556e17124aa19e98ec4c0b0de2eaeaefcb635"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Allow PWMJ to deal with residual equijoin conditions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"214ac0fbf22e1c04405dfa3e0303925691abbfd2d6929469df54125768b99262"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: snapshot the statistics after the body is optimized, see \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/physical_planner.rs"},"region":{"startLine":3471}}}],"partialFingerprints":{"codehealthFindingId/v1":"89370b79e8044967a7e9b1ed29de39a3edf19b7f060f9942a04e5ea7dc1d5ca2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (DataType::Union(, _), DataType::Union(_, _)) =\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":"datafusion/core/src/schema_equivalence.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eeedcceec1a665b192a73c6f8e5182cf4b7749bdc2ab9809dfece8476d4a227"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (DataType::Dictionary(_, _), DataType::Dictionary(_, _)) =\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":"datafusion/core/src/schema_equivalence.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2386009d8cfe28648ce619dfd85543a68c8b33cd82d3b777f2451295c51f468a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (DataType::Map(_, _), DataType::Map(_, _)) =\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":"datafusion/core/src/schema_equivalence.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded4b18caaf90f33126acd5d8b03b8eafd4e8d7c9db4a5cc392010c8824f6bec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (DataType::RunEndEncoded(_, _), DataType::RunEndEncoded(_, _)) =\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":"datafusion/core/src/schema_equivalence.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6a254c07ea69666141759a8b9e3fd4de6265ad504a184fcb9b1f03161b032e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO what about the other statements (like TransactionStart and TransactionEnd) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/context/mod.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6f7ed2f400534fc330b57c430e608d334ee42435925339dc5d29071a8fc23c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (https://github.com/apache/datafusion/issues/11600) remove downcast_ref from here. Should file format factory be an extension to session state?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/listing_table_factory.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b2413977e1cb03c05af6d73c20508e75da96cea8238a454cf6ebb142e74372"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is not where schema inference should be tested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/physical_plan/json.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c97ca92b17f611c15f9fec06cd8b31e69dc665bacab10260415605afc9130ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO test with create statement options such as compression \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/listing/table.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8e66d5d2005f18cd09c223f42021372ac33371cde139c49eca40a807d6dd36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO correct byte size: https://github.com/apache/datafusion/issues/14936"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/listing/table.rs"},"region":{"startLine":1762}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44a651a918446ae4ea39261975b20cf40a759864bd580a0d8492fce701b257f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO correct byte size: https://github.com/apache/datafusion/issues/14936"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/listing/table.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e800a68a127a6beb8c8fd5382cfd27c2493e8cefe1c23685caa83882410080f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO correct byte size: https://github.com/apache/datafusion/issues/14936"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/file_format/parquet.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"58752708756c4889d736a01ddad072739fe1a28fe516151d41c74df8567fcf49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO If [\u0060DFSchema\u0060] had spans, we could show 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":"datafusion/common/src/column.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"255071407d2402b5270b4134b7d8cebed2612e3365454e1b281fd4c2a6d8df16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Let\u0027s decide how we treat the numerical strings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/config.rs"},"region":{"startLine":2838}}}],"partialFingerprints":{"codehealthFindingId/v1":"520ec927bb7d95a6db1405ef276e5814c0b6ef032aa9f8248dba550285c49686"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Remove this custom implementation and the \u0022libc\u0022 dependency when \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/rounding.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4389186c0ac85cf0ef401b358d0bd3cd5be1c441c0fd621b8720de3bad1cc560"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can input stats still be used, but adjusted, when \u0060skip\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":"datafusion/common/src/stats.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bb2378d802dc2eaf613d4b48897e762b2b5f3c0ccbf5a681140eccc0c8b63f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Modify this to also allow specifying how listviews should be treated. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/utils/mod.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5c4a159e683490604ecf1bef7062616dcbde740b1676913d09791003defb93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: handle list view and 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":"datafusion/common/src/utils/mod.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f82da1e1ab392c2e12e7ae1877e08487791529fa7e7aae3fa370d5203a894a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: simplify this after https://github.com/apache/arrow-rs/pull/10363"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/consts.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d60ef3d888aaa0ccac7e9ad349778a12c97981adac90389741cc1832e23f086"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we might want to look into supporting ceil/floor here for floats. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80a09f48ed2d51b42ae87389627915bda4af7c6f979c2394afc9d45f253d29d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There is no test for FixedSizeList now, add it later \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":4403}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbb11530c7641e54297ac1919459547f7cbd3c563eac5ae8c97573a1ce6c994"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: https://github.com/apache/arrow-rs/pull/9213 might fix this ^"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":8965}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bee3290fc29bbd3f116a5c394467a635bdfa854d452e8a30e7179742993ed6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if negate supports f16, add these cases to \u0060test_scalar_negative_overflows\u0060 test case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/mod.rs"},"region":{"startLine":9659}}}],"partialFingerprints":{"codehealthFindingId/v1":"6524abd92b136fdb1c24f3995755d44420dfff7ddaeda8afbb649d7a55247521"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO potentially upstream this to arrow-rs so that we can \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/struct_builder.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ea1a0bc1375fc45e48222b16788cac0ce5d51c937723d02970ef615f197a3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO potentially upstream this to arrow-rs so that we can \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/scalar/struct_builder.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2abcd11e1da49871d0db92dbeaab09046ecec1c3ae92505b8e94777c606f126"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO expand unit test if csv::WriterBuilder allows public read access to properties \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/file_options/mod.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56d4a7b1125946167b7e63c7d4b27bc889b4936a623e861a8e2cbca1ffe2d63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Stable functions could be \u0060applicable\u0060, but that would require access to the 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":"datafusion/catalog-listing/src/helpers.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0618e76a7a0de9775765932614897521a71d1cfdb0c05df246766258fe11cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Stable functions could be \u0060applicable\u0060, but that would require access to the 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":"datafusion/catalog-listing/src/helpers.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2818720c033778a8840d0408be799454e6b45c36f8047a6ad6607890b040f785"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO other expressions are not handled 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":"datafusion/catalog-listing/src/helpers.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4050e5db14598a4862bcb8b84b6e53b2162610cfd2622b46deace6e0170d2894"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should we support filter pushdown? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/cte_worktable.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91d7c02fc844f031a23a17dc91d4f19a3fb7e31c713c496552d545b7f2dc2ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Stream 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":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0807aeecc98ebb385d52c675d2b14b87f6963166716dbaccf51bd4a6f1cd6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Stream 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":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d0055a25c8d3ffbc3a4ab23a5bb0f6e8162f7f82670772e2bdab6e4e623fc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Stream 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":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80ac3628add9277e9ddae0182617ce19e31239d42f1795199fe02daf7165448"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Stream 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":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6182f6394a7e73b13d25ea89225a91db9ff6e9b6ac5f4f86b174d6244414f77b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Stream 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":"datafusion/catalog/src/information_schema.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eee5fb3f845b6d8bba0fbe245364466a663dc63f08b255355463308626e6e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   TODO: Include special join types (Semi/Anti/Mark 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":"benchmarks/src/nlj.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd1abe0fda0993d8fd8eaf14ffcb0bca924ce523e2fce7cfeef56c0ceaa4ff7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: ensure the optimizer won\u0027t change the join order (it\u0027s not at \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/nlj.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"91776219771529876e8cddbd2e2ae25613ff1222769bfa413a86c06df67f29ae"}},{"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 \u0060datafusion-cli/src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion-cli/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"379e433f8d819fa9b80db47d77d6e71887673b78ae53bf501d6c469188e5ae0f"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 6 of 47 project(s) overshoot their size bounds, lowering Project Cohesion to 7.4/10. The most over is \u0060datafusion/physical-plan\u0060 (173402 LoC, 301 module-visible types across 21 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":"a2248d3eb62ff05ec0287485693c1aabdfcbd0283b927b689ffd0d58bf2ea2a6"},"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":"fbcd92f90a30661a7b47a7dce524210fdb7058e1a4a50389ac76bdcb33a17d89"},"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":"c2688be98a5ed860eab222fe819601f95bf5e5e5c8795a48026b0a64aa107a17"},"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":"17191dc2b56e1f6ba2bc06ea4e18b89a16aeb23e126b650c9136e4c7081cad9c"},"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":"4506f9c6f729c9dc906f7c0b0603fe6841a423633304f4667288e0b68ba31541"},"taxa":[{"id":"CWE-807","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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de78c66291369eccf94d359ec0c66ce05c2b90c1ce54745bc8aa1eb34a5e2677"},"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":"3a3efe8f1a44e60185a2bb3148b65be023b46cd455d5408328fe64dcb3d34eec"},"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":"63d0b308a81f7322b0779e12a8cff6340177a75d82b9b9a33f36061bfac10e9e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cf737791f98cac9025f32dce164e5cf3c436dc8a4bdee97838cddc25d74007c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50a00d38486a6fda3ee3a28182e7c19ac67daff6e75bef1ce85e461a68ca560b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00eb8e325b6495b76b75cd419c0dd9cd5a514156f5b697d0cef95ae95dc6cf10"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa5e08dfb12268c1bb77faa67b08915d59a93ab42ab0097703f3f957b5e8b84d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbf5c37cd914a6b2d366bbabff06f341cdd53403247e4c0221a56950f2f561c3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a86e984080b998513aa94590e1abca42a3735f13fda3cfe493cf6ba858534acc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20dfe8f80f58f394eb33ebeebd56f052be2850e771f6181cfd0e84cc1225b8a6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0cba50498c54fae1d8487858a979d2db85db51f160776d777a7eb3041e5b4342"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b217379f43fc4d19891b1692098a724011b059013dbb4a18bb713ccdbf99708b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c8a4c4240792f420145254fa068646feadcc975c4ef02c91d72b209c3205322"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf0b8358b4446fd4988f0acf2a197e4e87c602185d4732e6421272da9c8d3007"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e73369d2b7a691eec077dbf4c2d19083d2374750aa715f34f154ac03bffddea"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03eb398cfc5db1f7288c4597f1482bd65a6d5f8285bfd5132e4196372125863b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6235cdd9606a6268e89d9968388b2c244c765e0d81b6aa2ab4db82c3439b7d0a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30dc7b144123e7cddead29d5c90d2a1f35fc128ad8ea69860fcc844a8d2d6bfd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c319e540b518cfee469a18d32b73e08b84bb5e75e5b436af572c82c6b1625000"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a7dad6a225314f35dc26e15cf4abd5597e55d469a4981a2b6b32a21e08dcac2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aeff9a24a864bc444269feae78bc00f80b6c39772764c70cc78062b0cf8094bf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19fa1259e75355c919147287bfa06e00fbc18a44feacc76de95b39091d077756"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6baeb9d28d28027495122767632ca979d47df38917d6ccc49a070e9246d9c048"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"afd5536ee0bcc155c98caee709f7eb41e6d0cbe80ea1483225380db67c749332"},"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":"a50bf425751fec361d3323f5f57757a2ea41f59b8abe160d530fc7ca88f222c3"},"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":"af2e6c71975637b8262c391fe4e3404950c20ea81d252dd2b046399acb91005c"},"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":"090ce15e1b8ffdff00e33f96b22b0d2a3d71aecd1a65cbab63939f3c1c1e5774"},"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":"0c0fee30a995b0e18b19e6db661dcad393f11d0f24b29a6669803e8e51de38ed"},"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":"513841bb729b4d24a505b5252d158f8e65cb11a9c046c993c8c99b4731391685"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6674670e887caf942fa2bf2c2bd6db4fcd2cf079417a4d19f61291974ca95356"},"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":"26952fc5a8d0a7cace410b601383d73271988d35819d5ad887e753ac078d1ff7"},"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":"ed9e640a53004c86036b30116d645e0975579d488e3c29fe30a96cc00ad8d3e6"},"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":"db23259e7a884b8c68aa73dd95bd1df87a9e9ff6ab664c95f588e59b978997ef"},"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":"b60ec6b2fd9097e51d9074ed1edc017c0435a181b911a8f6b4b11c4cd0ff0606"},"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":"86c4c16241de82516af63e1148cf7cac23b3d09f0b90fcad271e2ad01f9ce684"},"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":"109f1893f117dbc09be51aa6266f41c2cb2a6aa1876c3fda2b3d928f63b952f4"},"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":"027bf8359a4fd4a9b897d5196935269294b0398a65235db030f4a596ac26199d"},"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":"7d978796cf969434740eed2122c3359d76293c7339801ec022be275a0c001df1"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35394d5a011643d921b5a79b0a127dd998ef43b39c4869f980e8684a5bc21423"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f83f21a2680a0d821d63abf3dc0bd2d667961223d00aab9176d75ffe3e173e3e"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e52a244d419752cbbb977911de76652f5804679e2d5a1dd372eee5fa11d9cde5"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4738d0215bcb6cee8cf6f53785b07352621b7491b0871e0909f7edb588f4f3cf"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e7bf29ffdbb3cb26cf287cbe688ff76bf0a7e7b3b97827fdde35f19dca1526b"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"4cc935eee7d71dd27f92a2ce9e004dacbd599d091b3f6386981d047162539806"},"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":"f49ee48fd6e37511d2c2a456cbf16d67aba685915073b2b655a14db7e0fc43b9"},"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":"5b00f6cb508e94f7c94dcd2bcd62148c1229672c3d682161d5b5edde0edf3e7b"},"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":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a982ceddfec2a5b5a877dec54955a6f48b5183963de8367439f7454473842e0"},"properties":{"dependency":{"package":"body-parser","version":"2.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0faca7f2fd4d452df7cdd2521c4aa80642aa6ece744473b88a14cf842ced8452"},"properties":{"dependency":{"package":"astral-tokio-tar","version":"0.6.2","advisory":"RUSTSEC-2026-0440","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca383df8f93c1fcb449201c7c47b9fc487e55acf31a9bb60212d29fe36dde189"},"properties":{"dependency":{"package":"block-buffer","version":"0.12.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b5cc6a78fe02a95b2f6755616011982ae866dcba8c2aeaae7b037f36ce19be5"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"061f734a696c8aa759fb51603ad3d203a82a53816b296255310573aefab727a0"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"935b9e27d1ff6bbb66a67f4e9358358da1517e07678644dbfae6ad5c51f0f0d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d17adc5b5ca9b6877afd1752fc924c2155295ca05eb20a374c7c061e1603dbf4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3adeb5ca433f8377e0513466abe226661632e2c7a65ab03d48b79033987746ab"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b1568673c97a5ce9b1ec5a08dba083d705b7ca92047378b6f33333438b27491"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8be28dfbddd65a7e332ce01235313147b1c55561e3694aa8941a467a4d640f3"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-json/src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f895fdf496988a3f06159bd91959a93c0e3dd3f4412a5a21b6a8ece5481b941"}},{"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":"datafusion/functions-window/src/macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b370ec281d35a44d6d2cf8ec5c5008a9e6f3db1c97cc0a69be5d6aca66f7760"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/arguments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57f76029ae4f913ca2e89c0231ca634cbac360c80b6ed75d0dfcbf60d450916"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 36 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: dev/create_license.py, datafusion/execution/src/object_store.rs, datafusion-cli/src/command.rs, datafusion/physical-expr/src/equivalence/properties/joins.rs, benchmarks/src/imdb/mod.rs, datafusion/catalog/src/listing_schema.rs, datafusion/physical-plan/src/aggregates/group_values/single_group_by/boolean.rs, datafusion/common/src/spans.rs (and 28 more) (39 orphaned of 995 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; 995 of the 1160 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":"dev/create_license.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e171fb0de37719b21f08d8f78d8864cf9f96123ceb2c932553e8acba0d4cace"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/execution/src/object_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"589503cdd395d47bbbdaffc70ad398dde12fad3f7fb84c6894b8535ecf75d835"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion-cli/src/command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eafd5a778ef42cf151825061a54d7050e7f5e3135af16647be168c997a94c2f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/equivalence/properties/joins.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d36a75c4d1fcd3900704bce033f465d74e764ae1c6b9429f03ea8b7d2a0fb8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/imdb/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"363b86ae95076eb6df8e38515606d1205cc9085ebb572c8b9cc44ccbc211e6f1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/listing_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde1a6e78319a1d03dc8e8093f94391033519a657c0a131f66f04001b7d8f38c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/spans.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa4c14381abd6f77312a2a08526a9295f49c6b0996ea6008e212eb79e694474"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/render_tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"392e268297c4a1f683fb0c84d6b0f92caefd7bd83faecc8c5cabac23eb41eaa3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/substrait/src/variation_const.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e4a0157c55350687e55c692916fddbc52cfcee5f7a6326e94d583a42223370"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common-runtime/src/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97db23227a1eedd473a7552f1a816d1365df76cd0fd1f5e5b2bda334ca22f17f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/group_values/single_group_by/boolean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db33e7f96ff9c6e7b7c23ac5c12ac07be53ccb46c3b88dc4825c8ea6254b87ad"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/diagnostic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"765f4ca261f4dbe295a5c62daa872dd5cdfda6a76e821a8fe1b0ff63b539d22f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/lineprotocol.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a6dabdba68f6c532345e4b55e848d105c9f3d2dd8bd3284ec35a7934e4360f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/sort_pushdown.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccae6fdd6c25269ea0db24e9fc75b7a06529007dabeac0f489bc410d0f8a9d3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-nested/src/macros_lambda.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b267b7e3fb99eafc16bb1b55e4b8860d5f81ddc498e5ce0ca5f3599de1f491"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/statistics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dd01c050be837c4d68777fecf5628aa1eb9afe2f0082ee067d386caac7d189"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/execution/context/csv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b3ee1c50f1eed8d758f3b06594f545cf617233ef2b7be0a609b7a7aa88452c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/metrics/custom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4686f942be5448553d2d7dcbf8cbf9c34971b9330663eb56d41243b232c1a0bc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-utils/src/array_gen/primitive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4523d79079bb1493c219ab9c1f273296d60e83f9148a7982683f137c5e192f8e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/tree_node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe56bcb36cf36d8861e1f0111ec6f4551158703b0f761d940b2c77a670fcc8d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/metrics/elapsed_compute.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4488d4357d45dada0f9a2b72383c64676366496b31f2cef88777f02c256850c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/optimizer/src/plan_signature.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07773836437684fae77cfea46481e3b3c2f3199a663a1a774542dded0f29712"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/file_options/csv_writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"200fc0db4e6efc9693c56bb00d4baef03614e7e4afa87489954bcc2a54cb0daf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-utils/src/array_gen/string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8556e8c79f52d3c0645f27651fc809a1b5e45e8721c8e7bfe8a6032b81442d6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/imdb/convert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b0c519477c425e13523ccc21c1508f8a21e695e2dca684b6ab0330a6864c7e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/ffi/src/ffi_option.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e3e85ca8ada157e1ffdb303ad07a042ebdc845e2aa902514d10d6b2a627f62"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr/src/intervals/test_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08d803c8b703210ae866c47d5ba1b05fcce72f0a90d7c09ed6b8b6395f1d8d7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/substring.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baf037e9cd9c70e75880cf55991cda1f2ca88582b4d20c5e88b95b3f4a5d36c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/math/bounds.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9445f8a544eee9b19556722acbb68d3c0527f767ec8266a4e5122f5c2b04d213"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/common/src/types/field.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f2bd3f0786ee9e02533cedfa6db27aa73d492030a1bd6133720015e3a1cfae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-expr-common/src/tree_node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfda55842700fd27cc30c97605cf2e8f4052a22f93dbf534d67fa520d305effc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-window/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"744afb1a98d437d05855d310e8f69f7309205f30addc6d1b55aae37a403ec74f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion-cli/src/cli_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ced532d1e7b5b2c606cb4b7cb4c13996ed48d23ad93536a3e46bfb755b0796"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-window-common/src/partition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee327c4f1fd8292d2d0c1a7044ebb0cfeb7dd5f88978a0403bfa7da139327c9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/extension_unparser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b7087694e4013595fa567cf5a5832397eabb4d0c40cda8558123186baf1c9d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/expr/grouping_set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9646ed3bb67f175b4816d528e714981cc09608f5ea5507d0d239ebc86c9ef8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: btrim.rs, ltrim.rs, rtrim.rs: 3 files \u2014 \u0060datafusion/functions/src/string/btrim.rs\u0060, \u0060datafusion/functions/src/string/ltrim.rs\u0060, \u0060datafusion/functions/src/string/rtrim.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions/src/string/btrim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf63984ae8024f358a46b9a9564acfde064c8f9eb6877352233aa14201c1f65"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: from_proto.rs \u2192 aggregates.rs, tree_node.rs, mod.rs, to_proto.rs: \u0060datafusion/proto/src/logical_plan/from_proto.rs\u0060 changes together with 4 other files \u2014 \u0060datafusion/expr-common/src/type_coercion/aggregates.rs\u0060, \u0060datafusion/expr/src/tree_node.rs\u0060, \u0060datafusion/functions/src/math/mod.rs\u0060, \u0060datafusion/proto/src/logical_plan/to_proto.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":"datafusion/proto/src/logical_plan/from_proto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd35b8311a230203095defac644758491becf10e03f08cfe10f0f103d7aaf73"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: file_format.rs \u2194 from_proto.rs: \u0060datafusion/datasource-parquet/src/file_format.rs\u0060 and \u0060datafusion/proto-models/src/from_proto.rs\u0060 change together 83% of the time (10 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 10 shared commits counted here, the most recent 3 are \u0060b43e8e86\u0060 feat: exact reverse scan for parquet sort pushdown (#27079); \u0060d89a85d3\u0060 fix: validate parquet.coerce_int96_tz when it is set. (#26420); \u006096eb0dfd\u0060 fix: validate parquet encoding when configured (#25784) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-parquet/src/file_format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae50ac32bf8ae13daa1a90c4dcb210df758c0de6059ab2e70f0ff003fecdff2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: avro.rs \u2194 csv.rs: \u0060datafusion/core/src/datasource/physical_plan/avro.rs\u0060 and \u0060datafusion/core/src/datasource/physical_plan/csv.rs\u0060 change together 75% of the time (9 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 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 \u006004c01bba\u0060 feat: add TableSchemaBuilder and store partition columns as Fields (#\u2026; \u00606eb8d45c\u0060 Let \u0060FileScanConfig\u0060 own a list of \u0060ProjectionExpr\u0060s (#18253); \u00603af31caa\u0060 Migrate datasource tests to insta (#15258) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/physical_plan/avro.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb458118ba750b48fa43291de5da7e93f2da5162166c8fb72190c9face771f31"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: csv.rs \u2194 json.rs: \u0060datafusion/core/src/datasource/file_format/csv.rs\u0060 and \u0060datafusion/core/src/datasource/file_format/json.rs\u0060 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) 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 20 shared commits counted here, the most recent 3 are \u00602ac032b4\u0060 fix: emit empty RecordBatch for empty file writes (#19370); \u006033be09ad\u0060 Revert \u0022fix: create file for empty stream\u0022 (#16682); \u00604084894e\u0060 fix: create file for empty stream (#16342) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/file_format/csv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4922ded148f23da5cefba54c0be621ede3f5bc6c070c25f365dcafb0e2d9fdf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 file_formats.rs: \u0060datafusion/proto-common/src/from_proto/mod.rs\u0060 and \u0060datafusion/proto/src/logical_plan/file_formats.rs\u0060 change together 72% of the time (28 of the 39 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 28 shared commits counted here, the most recent 3 are \u00605e5d79d3\u0060 introduce optional rle reads from parquet (#24227); \u00601b7f4035\u0060 feat: Add option to assign Parquet row groups to file ranges by midpo\u2026; \u006054f5cf16\u0060 fix(proto): check integer conversions in common options and constrain\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/from_proto/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea46a8e15240c6e60d0431db5122687d4f0ff4aba7b72d8233220a7088a4ec6c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: from_proto.rs \u2194 to_proto.rs: \u0060datafusion/proto/src/physical_plan/from_proto.rs\u0060 and \u0060datafusion/proto/src/physical_plan/to_proto.rs\u0060 change together 69% of the time (73 of the 106 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 73 shared commits counted here, the most recent 3 are \u00609c626cd7\u0060 feat: allow extension \u0060PhysicalExpr\u0060s to decode via a per-type regist\u2026; \u0060041a7167\u0060 Restore the From / TryFrom proto conversions dropped since 54.1.0 (#2\u2026; \u0060abc5ce7e\u0060 Proto: migrate MemorySourceConfig to per-source try_to_proto / try_fr\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto/src/physical_plan/from_proto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de365f0b1d1620d94e498cb62b228de7b271a70ac50b6877037f6a2a8e9dc321"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: to_proto.rs \u2192 aggregates.rs, tree_node.rs, mod.rs: \u0060datafusion/proto/src/logical_plan/to_proto.rs\u0060 changes together with 3 other files \u2014 \u0060datafusion/expr-common/src/type_coercion/aggregates.rs\u0060, \u0060datafusion/expr/src/tree_node.rs\u0060, \u0060datafusion/functions/src/math/mod.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":"datafusion/proto/src/logical_plan/to_proto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31358b7c0b08383ee86052380639689ca54ca92771a0fa11ff7e799fde697ad8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 file_formats.rs: \u0060datafusion/proto-common/src/to_proto/mod.rs\u0060 and \u0060datafusion/proto/src/logical_plan/file_formats.rs\u0060 change together 67% of the time (26 of the 39 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 26 shared commits counted here, the most recent 3 are \u00605e5d79d3\u0060 introduce optional rle reads from parquet (#24227); \u00601b7f4035\u0060 feat: Add option to assign Parquet row groups to file ranges by midpo\u2026; \u0060aa38d3c6\u0060 feat(pruning): expose pruning predicate IN-list rewrite size cap as a\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/proto-common/src/to_proto/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d511d0f6d5be47752075d04a3a654bdbd261d35d5d16ff4fb7caaca06c73f808"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: source.rs \u2194 test_util.rs: \u0060datafusion/datasource-csv/src/source.rs\u0060 and \u0060datafusion/datasource/src/test_util.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 \u006046b508eb\u0060 perf: optimize object store requests when reading CSV (#22962); \u006075d2473b\u0060 Remove SchemaAdapter (#19345); \u00608a91db56\u0060 Move statistics handling into FileScanConfig (#18721) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-csv/src/source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be7a56cdc81f2bea92edcc26dbec698683857a628166e514de909094d477f1c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: csv.rs \u2194 json.rs: \u0060datafusion/core/src/datasource/physical_plan/csv.rs\u0060 and \u0060datafusion/core/src/datasource/physical_plan/json.rs\u0060 change together 59% of the time (19 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) 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 19 shared commits counted here, the most recent 3 are \u00606eb8d45c\u0060 Let \u0060FileScanConfig\u0060 own a list of \u0060ProjectionExpr\u0060s (#18253); \u00603af31caa\u0060 Migrate datasource tests to insta (#15258); \u00601ae06a49\u0060 Rename \u0060DataSource\u0060 and \u0060FileSource\u0060 fields for consistency (#14898) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/physical_plan/csv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dae4a344300b953263070fb2a7c34ac939f762949529d10c305f5fec4ceab5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: grouped_hash_stream.rs \u2194 grouped_topk_stream.rs: \u0060datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/grouped_topk_stream.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 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 \u00608a922816\u0060 Refine and document AggregateExec metrics (#24757); \u00609f73cf17\u0060 Add aggregate-specific metrics to legacy grouped hash and TopK (#24523); \u006012bd5b07\u0060 mem: Cleanup resources of done streams immediately (#22064) (at that commit the files were still \u0060datafusion/physical-plan/src/aggregates/row_hash.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/topk_stream.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/grouped_hash_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ad03f78308b4c946b4f8239c5b57e9295d51acd1bfd7ed5755a6c5aead9d25"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: avro.rs \u2194 parquet.rs: \u0060datafusion/core/src/datasource/physical_plan/avro.rs\u0060 and \u0060datafusion/core/src/datasource/physical_plan/parquet.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 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 \u006004c01bba\u0060 feat: add TableSchemaBuilder and store partition columns as Fields (#\u2026; \u00606eb8d45c\u0060 Let \u0060FileScanConfig\u0060 own a list of \u0060ProjectionExpr\u0060s (#18253); \u00603af31caa\u0060 Migrate datasource tests to insta (#15258) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/physical_plan/avro.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"073db34a7860e12e7630482819803ebab967f7686dfd8ecc461fd21c47dd0bf0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: expr_schema.rs \u2194 tree_node.rs: \u0060datafusion/expr/src/expr_schema.rs\u0060 and \u0060datafusion/expr/src/tree_node.rs\u0060 change together 57% of the time (25 of the 44 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 25 shared commits counted here, the most recent 3 are \u0060f2b48359\u0060 feat: Add support for \u0060explode_outer\u0060 function for arrays (#22100); \u006088fa0dfc\u0060 Add \u0060Field\u0060 to \u0060Expr::Cast\u0060 -- allow logical expressions to express a\u2026; \u0060e221a2c5\u0060 feat: support customize metadata in alias for dataframe api (#15120) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d0c6a8131c65807c4439378db4abaa0597d73df727d6bca67d030030547b84"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: hash_table.rs \u2194 heap.rs: \u0060datafusion/physical-plan/src/aggregates/topk/hash_table.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/topk/heap.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 \u00606663e434\u0060 perf: Concretely typed TopK StringHeap, and StringHashTable slot reus\u2026; \u0060c81e7070\u0060 perf: Concretely typed TopK ArrowHashTable storage (#23609); \u006007e63edf\u0060 Fix TopK aggregation for UTF-8/Utf8View group keys and add safe fallb\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/topk/hash_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3df1c8bb41ce100f67b791b03136242f1f6b363743bb0f462e1d4ff8ccee5f7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: external_aggr.rs \u2192 run.rs, sort_tpch.rs, run.rs: \u0060benchmarks/src/bin/external_aggr.rs\u0060 changes together with 3 other files \u2014 \u0060benchmarks/src/imdb/run.rs\u0060, \u0060benchmarks/src/sort_tpch.rs\u0060, \u0060benchmarks/src/tpch/run.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":"benchmarks/src/bin/external_aggr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1d0e7fd420c5b8034d28585fce092beaf7d8d2f8bb4b24a8c7508c156d8882"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: json.rs \u2194 parquet.rs: \u0060datafusion/core/src/datasource/file_format/json.rs\u0060 and \u0060datafusion/core/src/datasource/file_format/parquet.rs\u0060 change together 52% of the time (14 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 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 14 shared commits counted here, the most recent 3 are \u00602ac032b4\u0060 fix: emit empty RecordBatch for empty file writes (#19370); \u006033be09ad\u0060 Revert \u0022fix: create file for empty stream\u0022 (#16682); \u00604084894e\u0060 fix: create file for empty stream (#16342) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/core/src/datasource/file_format/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe51306ce44c6cfe06a43d7327b6b49b6642c4f7ff47680212e3525e9e60815"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 to_proto.rs: \u0060datafusion/functions-aggregate/src/lib.rs\u0060 and \u0060datafusion/proto/src/physical_plan/to_proto.rs\u0060 change together 50% of the time (15 of the 30 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 15 shared commits counted here, the most recent 3 are \u006012d82c42\u0060 Move array \u0060ArrayAgg\u0060 to a \u0060UserDefinedAggregate\u0060 (#11448); \u00604ac14280\u0060 Convert \u0060nth_value\u0060 to UDAF (#11287); \u00604bc32281\u0060 Covert grouping to udaf (#11147) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78182809abb00ebeb78a16fdb182267d77ea28bec6adde54ff571dfc65ad9d72"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: aggregates.rs \u2194 lib.rs: \u0060datafusion/expr-common/src/type_coercion/aggregates.rs\u0060 and \u0060datafusion/functions-aggregate/src/lib.rs\u0060 change together 50% of the time (15 of the 30 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 15 shared commits counted here, the most recent 3 are \u00602222abda\u0060 refactor: remove unused \u0060type_coercion/aggregate.rs\u0060 functions (#18091); \u00604ac14280\u0060 Convert \u0060nth_value\u0060 to UDAF (#11287) (at that commit the file was still \u0060datafusion/expr/src/type_coercion/aggregates.rs\u0060); \u00604bc32281\u0060 Covert grouping to udaf (#11147) (at that commit the file was still \u0060datafusion/expr/src/type_coercion/aggregates.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/expr-common/src/type_coercion/aggregates.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4f90b00b211b419bf5a4f776ab69bf6a74f9b19cd8073ab30cfd117da6cd53"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: listing_schema.rs \u2194 listing_table_factory.rs: \u0060datafusion/catalog/src/listing_schema.rs\u0060 and \u0060datafusion/core/src/datasource/listing_table_factory.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 \u00602b05b09b\u0060 feat: Add builder API for CreateExternalTable to reduce verbosity (#1\u2026; \u0060da893951\u0060 feat: Add \u0060OR REPLACE\u0060 to creating external tables (#17580); \u0060636f4332\u0060 Minor: add flags for temporary ddl (#12561) (at that commit the file was still \u0060datafusion/core/src/catalog_common/listing_schema.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/listing_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfa90deccefb11c8d9ce6cbcb8269c39f34a9ebfbf598c57c840928da336ec0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: listing_schema.rs \u2194 statement.rs: \u0060datafusion/catalog/src/listing_schema.rs\u0060 and \u0060datafusion/sql/src/statement.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 \u00602b05b09b\u0060 feat: Add builder API for CreateExternalTable to reduce verbosity (#1\u2026; \u0060da893951\u0060 feat: Add \u0060OR REPLACE\u0060 to creating external tables (#17580); \u0060636f4332\u0060 Minor: add flags for temporary ddl (#12561) (at that commit the file was still \u0060datafusion/core/src/catalog_common/listing_schema.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/listing_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ebc9f81f3fa974493862e0e63cd46936619aaf36616372ce34cf2b25070c48"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 partial.rs: \u0060datafusion/physical-plan/src/aggregates/mod.rs\u0060 and \u0060datafusion/physical-plan/src/aggregates/order/partial.rs\u0060 change together 50% of the time (6 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 6 shared commits counted here, the most recent 3 are \u0060461dc6d6\u0060 refactor(hash-aggr): Support spilling for ordered aggregation (#23657); \u0060186ba4c3\u0060 Minor: make some physical-plan properties public (#12022); \u00605f38135d\u0060 Update arrow 47.0.0 in DataFusion (#7587) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/physical-plan/src/aggregates/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"521a7c660ddc3388ae696f9fc6084e37a5aacc6e30bcc8337c57f00e264a7c80"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cte_worktable.rs \u2194 physical_planner.rs: \u0060datafusion/catalog/src/cte_worktable.rs\u0060 and \u0060datafusion/core/src/physical_planner.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 \u00601b67f2e9\u0060 Docs: document manual catalog impls and how compilation got faster (#\u2026; \u006008bd332d\u0060 fix: Correctly compute nullability in recursive CTE schemas (#22552); \u00606859b93f\u0060 refactor: move \u0060CteWorkTable\u0060, \u0060default_table_source\u0060   a bunch of fi\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/catalog/src/cte_worktable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c7e0b8aa2188bbd4134f6392f64abb56e31338ed906247ce2f46bbef73f5bd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: first_last.rs \u2194 macros.rs: \u0060datafusion/functions-aggregate/src/first_last.rs\u0060 and \u0060datafusion/functions-aggregate/src/macros.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 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 5 shared commits counted here, the most recent 3 are \u006050dc83a1\u0060 Convert Option\u003CVec\u003Csort expression\u003E\u003E to Vec\u003Csort expression\u003E (#16615); \u006024a08465\u0060 Introduce expr builder for aggregate function (#10560); \u0060a0fccbf8\u0060 Move \u0060Covariance\u0060 (Sample) \u0060covar\u0060 / \u0060covar_samp\u0060 to be a User Define\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/functions-aggregate/src/first_last.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58984700e18e2635e629896057975f79cbb3f3ec68fae0641c98e47be55b7d5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: source.rs \u2194 test_util.rs: \u0060datafusion/datasource-arrow/src/source.rs\u0060 and \u0060datafusion/datasource/src/test_util.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 \u006075d2473b\u0060 Remove SchemaAdapter (#19345); \u00608a91db56\u0060 Move statistics handling into FileScanConfig (#18721); \u0060dfba2286\u0060 feat: allow pushdown of dynamic filters having partition cols (#18172) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/datasource-arrow/src/source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"051055414a08b0fb3cc46bc7fdc8a6f511edd42d3ed132950c0b94f89261c4b9"}},{"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":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","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":"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","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 \u0060datafusion_expr.async_udf\u0060 is marked as implementation by its own namespace, folder or name: \u0060AsyncScalarUDFImpl\u0060 (datafusion/expr/src/async_udf.rs:24, 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":"datafusion/expr/src/async_udf.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1336940c2ef792874a5895bb3b8841786b62110e6d52bd5e39a49cc0572ebd93"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060datafusion_expr.higher_order_function\u0060 is marked as implementation by its own namespace, folder or name: \u0060HigherOrderUDFImpl\u0060 (datafusion/expr/src/higher_order_function.rs:510, 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":"datafusion/expr/src/higher_order_function.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"85570a1414ece9f81fd11674bac69577b51af52a517f53beae0606b19171014b"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060datafusion_expr.udaf\u0060 is marked as implementation by its own namespace, folder or name: \u0060AggregateUDFImpl\u0060 (datafusion/expr/src/udaf.rs:451, 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":"datafusion/expr/src/udaf.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e19daa21c1ab0c348df0f5505385e812a8557d3dd0c2aa4ea1fc07cbb9bf63e"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060datafusion_expr.udf\u0060 is marked as implementation by its own namespace, folder or name: \u0060ScalarUDFImpl\u0060 (datafusion/expr/src/udf.rs:522, 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":"datafusion/expr/src/udf.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"966ef7ea3bc39a7665f15b7109bc01a79ffa565eac18fe397c2246de4df192ea"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060datafusion_expr.udwf\u0060 is marked as implementation by its own namespace, folder or name: \u0060WindowUDFImpl\u0060 (datafusion/expr/src/udwf.rs:302, 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":"datafusion/expr/src/udwf.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2721e544cf0fd8c317360473c20d45ab295c8c362f4f89eb5fe5f3bfce7f502"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060datafusion_session.table\u0060 is marked as implementation by its own namespace, folder or name: \u0060TableFunctionImpl\u0060 (datafusion/session/src/table.rs:758, 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":"datafusion/session/src/table.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"080fccb7892014404695fd973e55e89d88e612d5f572d34866961052303cc516"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 21/26 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060datafusion-examples\u0060, \u0060datafusion/proto-common/gen\u0060, \u0060datafusion/proto-models/gen\u0060, \u0060dev\u0060, \u0060xtask\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch gitsubmodule: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060gitsubmodule\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"189dbbebbc083d2f437329c82dc1cae8adbf1b7293a5bc9e2de708f747e84eda"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P6","level":"warning","message":{"text":"Release pipeline publishes an empty version: \u0060.github/workflows/dependencies.yml:40\u0060 writes \u0060CARGO_MACHETE_VERSION=$CARGO_MACHETE_VERSION\u0060 to \u0060$GITHUB_ENV\u0060, but \u0060$CARGO_MACHETE_VERSION\u0060 is assigned nowhere in that \u0060run:\u0060 block, and nowhere else in the workflow. POSIX shell expands an unset variable to the empty string, so \u0060env.CARGO_MACHETE_VERSION\u0060 is empty on every run and whatever consumes it is handed no version at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/dependencies.yml"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c264fffdfac26a4ff558cc5e0a70b6515264cfc0272f4a2d6fccb33524e715fc"}},{"ruleId":"P6","level":"warning","message":{"text":"Release pipeline publishes an empty version: \u0060.github/workflows/dev.yml:58\u0060 writes \u0060LYCHEE_VERSION=$LYCHEE_VERSION\u0060 to \u0060$GITHUB_ENV\u0060, but \u0060$LYCHEE_VERSION\u0060 is assigned nowhere in that \u0060run:\u0060 block, and nowhere else in the workflow. POSIX shell expands an unset variable to the empty string, so \u0060env.LYCHEE_VERSION\u0060 is empty on every run and whatever consumes it is handed no version at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/dev.yml"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"04360b2f9052cb64f8c3ed081f8d15802c679f05e3875446ce126cfb361810a9"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 6 plain JS \u2014 the untyped files are ci/scripts/cancel_merge_queue_runs.cjs, ci/scripts/draft_inactive_prs.cjs, ci/scripts/release_version_labeler.js, ci/scripts/test_cancel_merge_queue_runs.cjs, ci/scripts/test_fork_ci_status.cjs, datafusion/wasmtest/datafusion-wasm-app/index.js."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): ci/scripts/test_fork_ci_status.cjs:152 \u00B7 ci/scripts/test_fork_ci_status.cjs:263 \u2014 the two spans are one implementation copied and then locally edited \u2014 192 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/scripts/test_fork_ci_status.cjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5131ab4b2d68dd6d8823c559836350562b2b14685205469f869c4bb0dd087246"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ci/scripts/test_cancel_merge_queue_runs.cjs:285 \u00B7 ci/scripts/test_cancel_merge_queue_runs.cjs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/scripts/test_cancel_merge_queue_runs.cjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb13765357958b601b60e88c8fcb3102c7cebab5d520b032d7ec8a60bc5d039"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ci/scripts/test_cancel_merge_queue_runs.cjs:306 \u00B7 ci/scripts/test_cancel_merge_queue_runs.cjs:430 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/scripts/test_cancel_merge_queue_runs.cjs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8fa64cff8ab6c5b402457eb9df6b2df49b0fc91110145ed0866bdd26602047"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ci/scripts/test_cancel_merge_queue_runs.cjs:160 \u00B7 ci/scripts/test_cancel_merge_queue_runs.cjs:184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/scripts/test_cancel_merge_queue_runs.cjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2326c70a14a1178aa94165ed39c310f1faad78a8453a5b793bfb48d31208016"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 25, cognitive 44): run has cyclomatic complexity 25 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/scripts/cancel_merge_queue_runs.cjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6c807431f81542f5c9a480a2000270e0ffbc6706a1f07e252ec5ac6ad69924"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 11, cognitive 18): run has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/scripts/draft_inactive_prs.cjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5489be40af24d560c13b5489fd0675fb2b4483c3c47f1c48e459dd0013e5b3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/scripts/draft_inactive_prs.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"028f5f3157e0593ecb2e2c0a657daf0efec66776523c925dd2239cf661bc6056"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/scripts/release_version_labeler.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00394eedce7f5bc8b4fa02c22185fe534bbdba9965053660d3f5a746030bdd68"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/wasmtest/datafusion-wasm-app/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feb4751a230a33a9c08ff9a0e4207530df35b499b149ce8e622eaab71ad6851"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~169 LoC): no import path from any entry point (4 application, 3 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ci/scripts/draft_inactive_prs.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"443a0e9a1a73f5a58f972f3271408a09dc7d9ecf60bd5b6cb6425d344b9ef47a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!lhs.data_type().is_nested() \u0026\u0026 lhs.logical_null_count() == 0 \u0026\u0026 rhs.logical_null_count() == 0\u0060 appears character-identically in 2 files \u2014 datafusion/functions/src/core/greatest.rs, datafusion/functions/src/core/least.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":"datafusion/functions/src/core/greatest.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8cf25ead655ced946b86e8e0e21b6ba12387ce4ad6a108805b6192086fece6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060array.len() == 1 \u0026\u0026 !input_empty \u0026\u0026 input_all_scalar\u0060 appears character-identically in 2 files \u2014 datafusion/physical-expr/src/higher_order_function.rs, datafusion/physical-expr/src/scalar_function.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":"datafusion/physical-expr/src/higher_order_function.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e99b20a54bf24bb3b640f53c887ae5404512ddb7b9396a88f4eb9b1d702e6a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_positive_component \u0026\u0026 has_negative_component\u0060 appears character-identically in 2 files \u2014 datafusion/functions-nested/src/range.rs, datafusion/functions-table/src/generate_series.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":"datafusion/functions-nested/src/range.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c906be04c2c33a8f72fae3b357e8b2e41593e468ba225506ab605f3dd26dfab6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.boundedness().is_unbounded() || join_type == JoinType::LeftSemi\u0060 appears character-identically in 2 files \u2014 datafusion/physical-plan/src/joins/hash_join/exec.rs, datafusion/physical-plan/src/joins/nested_loop_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":"datafusion/physical-plan/src/joins/hash_join/exec.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a807d0c5733337e979d6fc2c9282445a22454a8f3fbe4ccc7324b262aa30f304"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060list_array1.is_null(row) || list_array2.is_null(row)\u0060 appears character-identically in 2 files \u2014 datafusion/functions-nested/src/cosine_distance.rs, datafusion/functions-nested/src/inner_product.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":"datafusion/functions-nested/src/cosine_distance.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca71e49545c60bd909b0b938ccedf1a1c1c0907be392b35b3d406ec87cea856"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060plan.is::\u003CGlobalLimitExec\u003E() || plan.is::\u003CLocalLimitExec\u003E()\u0060 appears character-identically in 2 files \u2014 datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs, datafusion/physical-optimizer/src/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":"datafusion/physical-optimizer/src/ensure_requirements/enforce_sorting/sort_pushdown.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd50b3936233f8d47f0a9459880dc5a957e1899efe784f5002e3dcb828cd83e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selection.null_count() == 0 \u0026\u0026 !selection.has_false()\u0060 appears character-identically in 2 files \u2014 datafusion/physical-expr-common/src/physical_expr.rs, datafusion/physical-plan/src/aggregates/aggregate_argument.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":"datafusion/physical-expr-common/src/physical_expr.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"692e3bfde531e488a33a361425b4fc3042c77f91eceea9c1894a147fee885eb7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.map.is_empty() \u0026\u0026 self.null.is_none()\u0060 appears character-identically in 2 files \u2014 datafusion/physical-expr-common/src/binary_map.rs, datafusion/physical-expr-common/src/binary_view_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":"datafusion/physical-expr-common/src/binary_map.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61911cad663fc4272eec665f1ffec4937cf912d063b9decfc246f5d26f96460"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060slice1.null_count() != 0 || slice2.null_count() != 0\u0060 appears character-identically in 2 files \u2014 datafusion/functions-nested/src/cosine_distance.rs, datafusion/functions-nested/src/inner_product.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":"datafusion/functions-nested/src/cosine_distance.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8016fa5619a4f4bcea3f5fecc5e268f7ea73f0c37ad3b9879f8c724280f3d28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target_field.name().is_empty() \u0026\u0026 target_field.is_nullable() \u0026\u0026 target_field.metadata().is_empty()\u0060 appears character-identically in 3 files \u2014 datafusion/expr/src/expr_schema.rs, datafusion/physical-expr/src/expressions/cast.rs, datafusion/physical-expr/src/expressions/try_cast.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":"datafusion/expr/src/expr_schema.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f30b6ba4f6db840b8c91c86b3243611329c124edb64f705f0c16f60d6f8aa3f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sql_op_precedence\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datafusion/sql/src/unparser/expr.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6a1c3d3cfaf733e24802ef9724c2f564140371a03b7f0b7a1d5cf8fef980d6"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-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-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-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-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-807","guid":"7b9d7bab-2171-935b-9279-889089164770","name":"Reliance on Untrusted Inputs in a Security Decision","shortDescription":{"text":"Reliance on Untrusted Inputs in a Security Decision"},"helpUri":"https://cwe.mitre.org/data/definitions/807.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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/"}]},{"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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":67,"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."]}]}