Sam == Samuel Tardieu s...@rfc1149.net writes:
Sam What is the best way to initialize primes-under-million at
Sam parsing time?
One intermediate solution is to make it foldable despite its output
being mutable. This is not worse semantically than what was done
before when the list was hardcoded
call it as a toplevel form and drop the result.
Doug
On Dec 29, 2008, at 12:10, Samuel Tardieu s...@rfc1149.net wrote:
Slava == Slava Pestov sl...@factorcode.org writes:
Slava Make it a MEMO: word. Then the result will only be computed
Slava once.
Done, you can pull from
Slava Make it a MEMO: word. Then the result will only be computed
Slava once.
Sam Done, you can pull from
Sam git://git.rfc1149.net/factor.git for-slava
Sam However, this will degrade performance for
Sam benchmark.binary-search, as the list will be computed at the
Sam first occurrence.
Doug
