Handle NaN in hit aggregation sorting

1 files changed, 1 insertions, 1 deletions

diff --git a/searchlib/src/main/java/com/yahoo/searchlib/aggregation/HitsAggregationResult.java b/searchlib/src/main/java/com/yahoo/searchlib/aggregation/HitsAggregationResult.java
index c7ecdbd798d..b462fb67dd5 100644
--- a/searchlib/src/main/java/com/yahoo/searchlib/aggregation/HitsAggregationResult.java
+++ b/searchlib/src/main/java/com/yahoo/searchlib/aggregation/HitsAggregationResult.java
@@ -161,7 +161,7 @@ public class HitsAggregationResult extends AggregationResult {
     public void postMerge() {
         Collections.sort(hits, new Comparator<Hit>() {
             public int compare(Hit lhs, Hit rhs) {
-                return (lhs.getRank() > rhs.getRank()) ? -1 : (lhs.getRank() < rhs.getRank()) ? 1 : 0;
+                return -Double.compare(lhs.getRank(), rhs.getRank());
             }
         });
         if ((maxHits >= 0) && (hits.size() > maxHits)) {