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.

Codecov Report

Attention: 13 lines in your changes are missing coverage. Please review.

Comparison is base (9b41a86) 96.23% compared to head (ae6f858) 96.23%.

@@                Coverage Diff                @@
##           release/0.3.x     #527      +/-   ##
=================================================
- Coverage          96.23%   96.23%   -0.01%     
=================================================
  Files                 46       46              
  Lines               5903     5917      +14     
=================================================
+ Hits                5681     5694      +13     
- Misses               222      223       +1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.