()
| 627 | |
| 628 | #[test] |
| 629 | fn limit_push_down_sort() -> Result<()> { |
| 630 | let table_scan = test_table_scan()?; |
| 631 | |
| 632 | let plan = LogicalPlanBuilder::from(table_scan) |
| 633 | .sort_by(vec![col("a")])? |
| 634 | .limit(0, Some(10))? |
| 635 | .build()?; |
| 636 | |
| 637 | // Should push down limit to sort |
| 638 | assert_optimized_plan_equal!( |
| 639 | plan, |
| 640 | @r" |
| 641 | Limit: skip=0, fetch=10 |
| 642 | Sort: test.a ASC NULLS LAST, fetch=10 |
| 643 | TableScan: test |
| 644 | " |
| 645 | ) |
| 646 | } |
| 647 | |
| 648 | #[test] |
| 649 | fn limit_push_down_sort_skip() -> Result<()> { |
nothing calls this directly
no test coverage detected
searching dependent graphs…