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

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


The following commit(s) were added to refs/heads/master by this push:
     new a51aab6d29 [FE](compile) fix master fe compile failed (#21971)
a51aab6d29 is described below

commit a51aab6d29cd9234a8b46e0eeb1614869846da35
Author: zhangstar333 <[email protected]>
AuthorDate: Wed Jul 19 18:02:00 2023 +0800

    [FE](compile) fix master fe compile failed (#21971)
    
    fix master fe compile failed
---
 fe/fe-core/src/main/java/org/apache/doris/nereids/memo/Memo.java | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/fe/fe-core/src/main/java/org/apache/doris/nereids/memo/Memo.java 
b/fe/fe-core/src/main/java/org/apache/doris/nereids/memo/Memo.java
index ee5f355610..bcd784252d 100644
--- a/fe/fe-core/src/main/java/org/apache/doris/nereids/memo/Memo.java
+++ b/fe/fe-core/src/main/java/org/apache/doris/nereids/memo/Memo.java
@@ -48,6 +48,7 @@ import java.util.ArrayList;
 import java.util.Iterator;
 import java.util.List;
 import java.util.Map;
+import java.util.Map.Entry;
 import java.util.Optional;
 import java.util.PriorityQueue;
 import java.util.stream.Collectors;
@@ -760,9 +761,9 @@ public class Memo {
         Preconditions.checkArgument(n > 0, "the n %d must be greater than 0 in 
nthPlan", n);
         List<Pair<Long, Double>> plans = rankGroup(root, 
PhysicalProperties.GATHER);
         plans = plans.stream().filter(
-                        p -> !p.second.equals(Double.NaN)
-                                && !p.second.equals(Double.POSITIVE_INFINITY)
-                                && !p.second.equals(Double.NEGATIVE_INFINITY))
+                p -> !p.second.equals(Double.NaN)
+                        && !p.second.equals(Double.POSITIVE_INFINITY)
+                        && !p.second.equals(Double.NEGATIVE_INFINITY))
                 .collect(Collectors.toList());
         // This is big heap, it always pops the element with larger cost or 
larger id.
         PriorityQueue<Pair<Long, Double>> pq = new PriorityQueue<>((l, r) -> 
Math.abs(l.second - r.second) < threshold


---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]

Reply via email to