chore(deps): Bump itertools from 0.12.1 to 0.13.0 (#17075)

Signed-off-by: dependabot[bot] <support@github.com>
Signed-off-by: Richard Chien <stdrc@outlook.com>
Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>
Co-authored-by: Richard Chien <stdrc@outlook.com>

Cargo.toml

@@ -158,7 +158,7 @@ deltalake = { git = "https://github.com/risingwavelabs/delta-rs", rev = "5c2dccd
     "s3-no-concurrent-write",
     "gcs",
 ] }
-itertools = "0.12.0"
+itertools = "0.13.0"
 jsonbb = "0.1.4"
 lru = { git = "https://github.com/risingwavelabs/lru-rs.git", rev = "2682b85" }
 parquet = { version = "53", features = ["async"] }

src/expr/macro/src/gen.rs

@@ -61,15 +61,8 @@ impl FunctionAttr {
         }
         let args = self.args.iter().map(|ty| types::expand_type_wildcard(ty));
         let ret = types::expand_type_wildcard(&self.ret);
-        // multi_cartesian_product should emit an empty set if the input is empty.
-        let args_cartesian_product =
-            args.multi_cartesian_product()
-                .chain(match self.args.is_empty() {
-                    true => vec![vec![]],
-                    false => vec![],
-                });
         let mut attrs = Vec::new();
-        for (args, mut ret) in args_cartesian_product.cartesian_product(ret) {
+        for (args, mut ret) in args.multi_cartesian_product().cartesian_product(ret) {
             if ret == "auto" {
                 ret = types::min_compatible_type(&args);
             }

src/frontend/src/optimizer/plan_node/logical_join.rs

@@ -134,7 +134,7 @@ impl LogicalJoin {
             .collect_input_refs(self.core.left.schema().len() + self.core.right.schema().len());
         let index_group = input_refs
             .ones()
-            .group_by(|i| *i < self.core.left.schema().len());
+            .chunk_by(|i| *i < self.core.left.schema().len());
         let left_index = index_group
             .into_iter()
             .next()

src/frontend/src/optimizer/rule/apply_join_transpose_rule.rs

@@ -482,7 +482,7 @@ impl ApplyJoinTransposeRule {
                 d_t2_bit_set.set_range(0..apply_left_len, true);
                 d_t2_bit_set.set_range(apply_left_len + join_left_len..apply_len, true);
 
-                for (key, group) in &apply_on.into_iter().group_by(|expr| {
+                for (key, group) in &apply_on.into_iter().chunk_by(|expr| {
                     let collect_bit_set = expr.collect_input_refs(apply_len);
                     if collect_bit_set.is_subset(&d_t1_bit_set) {
                         0