[
https://issues.apache.org/jira/browse/LUCENE-8180?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16370402#comment-16370402
]
Adrien Grand commented on LUCENE-8180:
--------------------------------------
I was mostly thinking about the moderately sparse case (eg. about 1/30th of
bits set) on a large index with matches that are not uniformly spread across
the doc ID space. I can't tell how common it is but I wouldn't be surprised
that it was not so uncommon, and in that case there could be some long runs of
zeros.
> Explore using (Future)Arrays.mismatch for FixedBitSet.nextSetBit
> ----------------------------------------------------------------
>
> Key: LUCENE-8180
> URL: https://issues.apache.org/jira/browse/LUCENE-8180
> Project: Lucene - Core
> Issue Type: Improvement
> Reporter: Adrien Grand
> Priority: Trivial
> Labels: newdev
>
> Using Arrays.mismatch with a fixed-size array full of zeros might help find
> the next long that is not 0 faster.
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
