-
-
Notifications
You must be signed in to change notification settings - Fork 31.4k
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
bpo-37295: More direct computation of power-of-two factor in math.comb #30313
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can it be used in count_set_bits()
?
I'm not sure how. Can you elaborate? We could use a lookup table for small values in the popcount implementation, but I'm not sure it's worth changing. |
We could use the same lookup table in the popcount implementation for For #30305 I will need to extend the table to 127. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM besides few comments.
Co-authored-by: Serhiy Storchaka <storchaka@gmail.com>
…math-comb-zero-counts
This PR replaces the current popcount-based code for computing the largest power of two dividing math.comb(n, k) (for small n) with a more direct method based on counting trailing zeros of the factorials involved. See the issue for further discussion.
https://bugs.python.org/issue37295