Closed avadov closed 12 months ago
By the way, I was trying to implement progressive expansion of the primes list. The primes(n) function exhausts all RAM with n=10^10. This limitation can be bypassed by alternative techniques. But would such a long primes list be useful? Say, finding all primes <= 10^11?
I pushed up small changes to appease the formatter. I also added a unit test for the bug you identified and fixed. Thanks!
By the way, I was trying to implement progressive expansion of the primes list. The primes(n) function exhausts all RAM with n=10^10. This limitation can be bypassed by alternative techniques. But would such a long primes list be useful? Say, finding all primes <= 10^11?
I also thought about dynamically expanding the primes table. Do you think that would have utility? I don't want to blow up the memory (without the user knowing). Do you have a working prototype to share? Feel free to open a separate pull request and we can discuss / test it.
Attention: 13 lines
in your changes are missing coverage. Please review.
Comparison is base (
9b41a86
) 96.23% compared to head (ae6f858
) 96.23%.
Files | Patch % | Lines |
---|---|---|
src/galois/_prime.py | 50.00% | 13 Missing :warning: |
:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.
Also, it fixes the bug of skipping the first two numbers after n. For example, in the previous version: