fmt

Author: adriangb

datafusion/expr/src/logical_plan/plan.rs

@@ -2691,7 +2691,8 @@ impl TableScan {
         fetch: Option<usize>,
         preferred_ordering: Option<Vec<SortExpr>>,
     ) -> Result<Self> {
-        let mut table_scan = Self::try_new(table_name, table_source, projection, filters, fetch)?;
+        let mut table_scan =
+            Self::try_new(table_name, table_source, projection, filters, fetch)?;
         table_scan.preferred_ordering = preferred_ordering;
         Ok(table_scan)
     }

datafusion/optimizer/src/push_down_sort.rs

@@ -44,7 +44,7 @@ impl PushDownSort {
     }
 
     /// Checks if a sort expression can be pushed down to a table scan.
-    /// 
+    ///
     /// Currently, we only support pushing down simple column references
     /// because table providers typically can't optimize complex expressions
     /// in sort pushdown.
@@ -108,7 +108,7 @@ impl OptimizerRule for PushDownSort {
         // The table provider may or may not be able to satisfy the ordering,
         // but that's up to the table provider to decide
         let new_plan = LogicalPlan::TableScan(new_table_scan);
-        
+
         Ok(Transformed::yes(new_plan))
     }
 
@@ -129,11 +129,7 @@ mod tests {
         assert!(PushDownSort::can_pushdown_sort_expr(&sort_expr));
 
         // Complex expression should not be pushable
-        let sort_expr = SortExpr::new(
-            col("a") + col("b"), 
-            true, 
-            false
-        );
+        let sort_expr = SortExpr::new(col("a") + col("b"), true, false);
         assert!(!PushDownSort::can_pushdown_sort_expr(&sort_expr));
     }
 
@@ -142,4 +138,4 @@ mod tests {
         let rule = PushDownSort::new();
         assert_eq!(rule.name(), "push_down_sort");
     }
-}
+}