Re^8: Number functions.. primes (ugly code runs faster)

in reply to Re^7: Number functions.. primes (ugly code runs faster)
in thread Number functions I have lying around

Regarding memory use: the result array footprint probably outweighs the sieve for limits up to 10¹⁴.

Re: code. m//gogo is the sole bit of artistic liberty (or wishful thinking) and can be shortened to just //g. And sure, you're welcome to it, to work on it or repost it. An anonymonk couldn't say no, anyhow.

Comment on Re^8: Number functions.. primes (ugly code runs faster) Select or Download Code

Replies are listed 'Best First'.
Re^9: Number functions.. primes (ugly code runs faster) by danaj (Friar) on May 08, 2015 at 03:33 UTC
On memory footprint, it's important if using it for just the count where there is no array. Also for cases where we hold onto the string for later use in walking primes without resieving or storing the array. However, even doubling the string memory still results in >10x less memory than the array versions. Thanks re posting. Given the licensing, I thought it was prudent to ask.	[reply]

In Section Cool Uses for Perl