From c77c3d1bb48b6794cc182822029e904a29473c69 Mon Sep 17 00:00:00 2001 From: desmondcheongzx Date: Thu, 12 Dec 2024 04:39:19 +0800 Subject: [PATCH] Cleanup --- .../src/optimization/rules/reorder_joins/greedy_join_order.rs | 2 +- .../src/optimization/rules/reorder_joins/join_graph.rs | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/src/daft-logical-plan/src/optimization/rules/reorder_joins/greedy_join_order.rs b/src/daft-logical-plan/src/optimization/rules/reorder_joins/greedy_join_order.rs index 3d003ccd91..0f5a12592d 100644 --- a/src/daft-logical-plan/src/optimization/rules/reorder_joins/greedy_join_order.rs +++ b/src/daft-logical-plan/src/optimization/rules/reorder_joins/greedy_join_order.rs @@ -53,7 +53,7 @@ impl GreedyJoinOrderer { let right_neighbors = join_graph.adj_list.0.remove(&right).unwrap(); let mut new_join_edges = HashMap::new(); - // Helper function that takes in neighbors to the left and right nodes, the combines edges that point + // Helper function that takes in neighbors to the left and right nodes, then combines edges that point // back to the left and/or right nodes into edges that point to the new join node. let mut update_neighbors = |neighbors: HashMap>| { diff --git a/src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs b/src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs index 94ea453fb3..e7c09f3174 100644 --- a/src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs +++ b/src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs @@ -76,7 +76,7 @@ impl std::fmt::Display for JoinAdjList { for (node, neighbors) in &self.0 { writeln!(f, "Node {}:", node.name())?; for (neighbor, join_conds) in neighbors { - writeln!(f, " -> {} with conditions:", neighbor.name())?; + writeln!(f, " -> {} with conditions:", neighbor.name())?; for (i, cond) in join_conds.iter().enumerate() { writeln!(f, " {}: {} = {}", i, cond.left_on, cond.right_on)?; }