Build with jdk20

2 files changed, 4 insertions, 5 deletions

diff --git a/predicate-search/src/main/java/com/yahoo/search/predicate/benchmarks/ResultMetrics.java b/predicate-search/src/main/java/com/yahoo/search/predicate/benchmarks/ResultMetrics.java
index 11103a2a66a..ef65d9e2efa 100644
--- a/predicate-search/src/main/java/com/yahoo/search/predicate/benchmarks/ResultMetrics.java
+++ b/predicate-search/src/main/java/com/yahoo/search/predicate/benchmarks/ResultMetrics.java
@@ -62,8 +62,8 @@ public class ResultMetrics {
     }
 
     private double percentile(double percentile) {
-        int targetCount = (int) Math.round(totalQueries * percentile);
-        int currentCount = 0;
+        long targetCount = Math.round(totalQueries * percentile);
+        long currentCount = 0;
         int index = 0;
         while (currentCount < targetCount && index < SLOTS) {
             currentCount += latencyHistogram[index];
diff --git a/predicate-search/src/main/java/com/yahoo/search/predicate/index/CachedPostingListCounter.java b/predicate-search/src/main/java/com/yahoo/search/predicate/index/CachedPostingListCounter.java
index e6db1dec7c3..eb8b0b9927b 100644
--- a/predicate-search/src/main/java/com/yahoo/search/predicate/index/CachedPostingListCounter.java
+++ b/predicate-search/src/main/java/com/yahoo/search/predicate/index/CachedPostingListCounter.java
@@ -75,7 +75,7 @@ public class CachedPostingListCounter {
 
     private void countUsingBitVector(byte[] nPostingListsForDocument, int postingListBitmap) {
         for (int docId = 0; docId < nDocuments; docId++) {
-            nPostingListsForDocument[docId] += Integer.bitCount(bitVector[docId] & postingListBitmap);
+            nPostingListsForDocument[docId] += (byte)Integer.bitCount(bitVector[docId] & postingListBitmap);
         }
     }
 
@@ -88,8 +88,7 @@ public class CachedPostingListCounter {
     }
 
     public CachedPostingListCounter rebuildCache() {
-        MinMaxPriorityQueue<Entry> mostExpensive = MinMaxPriorityQueue
-                .maximumSize(32).expectedSize(32).create();
+        MinMaxPriorityQueue<Entry> mostExpensive = MinMaxPriorityQueue.maximumSize(32).expectedSize(32).create();
         synchronized (this) {
             for (ObjectLongPair<int[]> p : frequency.keyValuesView()) {
                 mostExpensive.add(new Entry(p.getOne(), p.getTwo()));