[FE](compile) fix master fe compile failed (#21971)
fix master fe compile failed
This commit is contained in:
@ -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
|
||||
|
||||
Reference in New Issue
Block a user