[
https://issues.apache.org/jira/browse/LUCENE-3179?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13045679#comment-13045679
]
Dawid Weiss commented on LUCENE-3179:
-------------------------------------
Oh, ok -- clear. So, my comment was related to the various methods of doing
bitcounts and other bit-fiddling on arrays of long values (for example
pop_array) -- these are HD derived implementations; I compared them to naive
loops using intrinsics and naive loops on cpus (and jvms) without intrinsics --
in that case simple loops with intrinsics was faster than Lucene's code, but
Lucene's code was faster than simple loops without intrinsics (effectively
using whatever was in the std. library).
> OpenBitSet.prevSetBit()
> -----------------------
>
> Key: LUCENE-3179
> URL: https://issues.apache.org/jira/browse/LUCENE-3179
> Project: Lucene - Java
> Issue Type: Improvement
> Reporter: Paul Elschot
> Priority: Minor
> Fix For: 3.3
>
> Attachments: LUCENE-3179.patch
>
>
> Find a previous set bit in an OpenBitSet.
> Useful for parent testing in nested document query execution LUCENE-2454 .
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
