On Nov 14, 2007 1:06 PM, Brent Yorgey <[EMAIL PROTECTED]> wrote: > On Nov 14, 2007 12:32 PM, Kurt Hutchinson <[EMAIL PROTECTED]> wrote: > The merging can be done much more simply and efficiently (this is code I > wrote when computing squarefree numbers in a blog post a few months ago):
Wow, thanks for the tip. That really is a huge speed-up. I attempted something like this, but just tried doing a fold of the simple merge over the list of lists. That didn't work (not lazy enough?), which is what sent me down the complicated path above. Kurt _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
