You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@bookkeeper.apache.org by GitBox <gi...@apache.org> on 2022/07/06 19:51:34 UTC

[GitHub] [bookkeeper] michaeljmarshall commented on a diff in pull request #3390: [Issue 3389] Prioritize compaction of entry logs with the lowest amount of remaining usable data

michaeljmarshall commented on code in PR #3390:
URL: https://github.com/apache/bookkeeper/pull/3390#discussion_r915201672


##########
bookkeeper-server/src/main/java/org/apache/bookkeeper/bookie/GarbageCollectorThread.java:
##########
@@ -547,6 +549,9 @@ void doCompactEntryLogs(double threshold, long maxTimeMillis) throws EntryLogMet
         MutableLong end = new MutableLong(start);
         MutableLong timeDiff = new MutableLong(0);
 
+        PriorityQueue<EntryLogMetadata> pq = new PriorityQueue<>(Comparator

Review Comment:
   Is it likely to hit a case where there are so many entry logs that we're not able to build this map in time?



-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: issues-unsubscribe@bookkeeper.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org