prudhvigodithi commented on issue #14485: URL: https://github.com/apache/lucene/issues/14485#issuecomment-2870497304
So from my understanding, Instead of creating one large BitSet for the entire segment (sized for maxDoc), the suggestion is to: - Create a smaller BitSet that only covers the specific range of document IDs in a partition. - Use the minDocId and maxDocId of the partition to define this range, something like as follows: ``` int rangeSize = maxDocId - minDocId + 1; this.threshold = rangeSize >>> 7; ``` So now the memory cost of the BitSet would be based on the range size, not maxDoc. -- 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-unsubscr...@lucene.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For additional commands, e-mail: issues-h...@lucene.apache.org
