(auron) branch master updated: [AURON #1695] Improve SortMergeJoin: move has_multi_equal out of loop (#1696)

[wanglei]

This is an automated email from the ASF dual-hosted git repository.

wanglei pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/auron.git


The following commit(s) were added to refs/heads/master by this push:
     new 0daa4dfb [AURON #1695] Improve SortMergeJoin: move has_multi_equal out 
of loop (#1696)
0daa4dfb is described below

commit 0daa4dfbc168f0c9a13e6a6cd4ea0337ae48ef7f
Author: James Xu <xumingmi...@gmail.com>
AuthorDate: Tue Dec 16 14:25:18 2025 +0800

    [AURON #1695] Improve SortMergeJoin: move has_multi_equal out of loop 
(#1696)
    
    # Which issue does this PR close?
    
    Closes #1695 .
    
     # Rationale for this change
    
    
    # What changes are included in this PR?
    
    The has_multi_equal is moved out of loop.
    
    # Are there any user-facing changes?
    
    No.
    
    # How was this patch tested?
    
    Existing UTs.
---
 native-engine/datafusion-ext-plans/src/joins/smj/full_join.rs | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/native-engine/datafusion-ext-plans/src/joins/smj/full_join.rs 
b/native-engine/datafusion-ext-plans/src/joins/smj/full_join.rs
index 3f2e0677..a810b1b2 100644
--- a/native-engine/datafusion-ext-plans/src/joins/smj/full_join.rs
+++ b/native-engine/datafusion-ext-plans/src/joins/smj/full_join.rs
@@ -131,14 +131,12 @@ impl<const L_OUTER: bool, const R_OUTER: bool> Joiner for 
FullJoiner<L_OUTER, R_
                     cur_forward!(cur2);
 
                     // iterate both stream, find smaller one, use it for 
probing
-                    let mut has_multi_equal = false;
                     let mut l_equal = true;
                     let mut r_equal = true;
                     while l_equal && r_equal {
                         if l_equal {
                             l_equal = !cur1.finished() && cur1.cur_key() == 
cur1.key(l_key_idx);
                             if l_equal {
-                                has_multi_equal = true;
                                 equal_lindices.push(cur1.cur_idx());
                                 cur_forward!(cur1);
                             }
@@ -146,7 +144,6 @@ impl<const L_OUTER: bool, const R_OUTER: bool> Joiner for 
FullJoiner<L_OUTER, R_
                         if r_equal {
                             r_equal = !cur2.finished() && cur2.cur_key() == 
cur2.key(r_key_idx);
                             if r_equal {
-                                has_multi_equal = true;
                                 equal_rindices.push(cur2.cur_idx());
                                 cur_forward!(cur2);
                             }
@@ -154,6 +151,7 @@ impl<const L_OUTER: bool, const R_OUTER: bool> Joiner for 
FullJoiner<L_OUTER, R_
                     }
 
                     // fast path for one-to-one join
+                    let has_multi_equal = equal_lindices.len() > 1 || 
equal_rindices.len() > 1;
                     if !has_multi_equal {
                         self.lindices.push(l_key_idx);
                         self.rindices.push(r_key_idx);