>>>>> "Sam" == Samuel Tardieu <[email protected]> writes:
Sam> Sure, but that was just an example. It would be great to be able Sam> to indicate that the list of primes between two numbers can be Sam> known at compile time if the bounds are. Argh, this is what broke "benchmark.binary-search" (sorry about that): it uses "primes-under-million" in a loop, which gets recomputed every time because I removed the incorrect "foldable" on "primes-upto". What is the best way to initialize "primes-under-million" at parsing time? Sam -- Samuel Tardieu -- [email protected] -- http://www.rfc1149.net/ ------------------------------------------------------------------------------ _______________________________________________ Factor-talk mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/factor-talk
