Re: [Haskell-cafe] FASTER primes (was: Re: Code and Perf. Data for Prime Finders (was: Genuine Eratosthenes sieve))

2009-12-29 Thread Daniel Fischer
Am Dienstag 29 Dezember 2009 04:38:21 schrieb Will Ness: > Now _this_, when tested as interpreted code in GHCi, runs about 2.5x times > faster than Priority Queue based code from Melissa O'Neill's ZIP package > mentioned at the haskellwiki/Prime_Numbers page, with > about half used memory reported,

[Haskell-cafe] FASTER primes (was: Re: Code and Perf. Data for Prime Finders (was: Genuine Eratosthenes sieve))

2009-12-28 Thread Will Ness
apfelmus quantentunnel.de> writes: > ~~ This is a repost, with apologies to anyone who sees this twice (I've replied to a two years old thread, and it doesn't show up in GMANE as I thought it would). ~~ > Dave Bayer wrote: > > What I'm calling a "venturi" > > > >venturi :: Ord a => [