-
Notifications
You must be signed in to change notification settings - Fork 13.3k
Add ctpop and other bit counting intrinsics #2777
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Comments
It'd be nice to have specific use cases for these. Are there programs that we cannot write now that we want to write that would use these intrinsics? |
I could use them in the sudoku solver we have as a performance test. Other uses: SAT3 solvers, chess engines (or so I've heard), computing the hamming weight, bitfield based index structures may benefit, and there was a hash table algorithm that uses them. |
I added a pull-request implementing these intrinsics, if someone wants to have a look: #4245 |
Add support for bitcount intrinsics Issue #2777
this landed. Thanks! |
@boggle suggested adding these in a comment on 0a99912#commitcomment-1527123
The text was updated successfully, but these errors were encountered: