Hi David. Thank you for the tip on Inline::Module. I played with Math::Prime::FastSieve some time back and made a local version by replacing the primes function with Algorithm3, a practical sieve algorithm by Xuedong Luo. It was a learning experience at the time and got to see primes compute faster.
Update: If interested, Algorithm3 which I applied to my local copy of Math::Prime::FastSieve.
In reply to Re^2: About Moo and Inline::C
by marioroy
in thread About Moo and Inline::C
by karlgoethebier
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |