Re: [PR] CASSANDRA-21605 Improve algorithmic complexity for finding intersecting SSTables for LCS compaction candidates [cassandra]

["krummas (via GitHub)" <gi...@apache.org>]

krummas commented on code in PR #5061:
URL: https://github.com/apache/cassandra/pull/5061#discussion_r3931621285


##########
src/java/org/apache/cassandra/db/compaction/LeveledGenerations.java:
##########
@@ -96,6 +96,13 @@ Set<SSTableReader> get(int level)
         return levels[level - 1];
     }
 
+    TreeSet<SSTableReader> getSortedLevel(int level)
+    {
+        if (level > levelCount() - 1 || level <= 0)

Review Comment:
   this needs to make sure `level <= 1`



-- 
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: pr-unsubscribe@cassandra.apache.org

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


---------------------------------------------------------------------
To unsubscribe, e-mail: pr-unsubscribe@cassandra.apache.org
For additional commands, e-mail: pr-help@cassandra.apache.org