jpountz opened a new issue, #13084: URL: https://github.com/apache/lucene/issues/13084
### Description @uschindler asked this question in https://lists.apache.org/thread/6o3hn3x8syfm8lj93kk5rrxb0kx701gp. In this discussion, we were looking for introducing the ability to iterate deleted docs, in order to compute (cheaply!) some facets across the entire doc ID space, to then fix counts by iterating deleted docs and decrementing counts in buckets where they belong. Using a `SparseFixedBitSet` in the sparse case would help have a good iterator all the time, rather that requiring O(maxDoc) all the time because this is what `FixedBitSet` requires to iterate all clear bits. If having sequential access on deletes wasn't a requirement, a set-based approach would work too. -- 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.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
