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

2009-12-30 Thread Will Ness
Daniel Fischer web.de> writes: > No, it's my own code. Nothing elaborate, just sieving numbers 6k±1, twice as fast as the haskellwiki code (here) and uses only 1/3 the memory. For the record: . thanks! will need to sift through it thoroughly... :) :) > > > > BTW I think a really sma

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

2009-12-29 Thread Daniel Fischer
Am Mittwoch 30 Dezember 2009 01:23:32 schrieb Will Ness: > Daniel Fischer web.de> writes: > > Gee, seems my mail server reads your posts very thoroughly today :) > > I hope it's not a bad thing. :) > It means, twenty minutes after I replied to the previous, I got your hours old post which menti

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

2009-12-29 Thread Will Ness
Daniel Fischer web.de> writes: > > > Gee, seems my mail server reads your posts very thoroughly today :) I hope it's not a bad thing. :) > > Am Dienstag 29 Dezember 2009 14:58:10 schrieb Will Ness: > > > > If I realistically needed primes generated in a real life setting, I'd > > probably ha

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

2009-12-29 Thread Daniel Fischer
Gee, seems my mail server reads your posts very thoroughly today :) Am Dienstag 29 Dezember 2009 14:58:10 schrieb Will Ness: > Eugene Kirpichov gmail.com> writes: > > 2009/12/29 Will Ness yahoo.com>: > > > Daniel Fischer web.de> writes: > > >> Am Dienstag 29 Dezember 2009 04:38:21 schrieb Will

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

2009-12-29 Thread Will Ness
Daniel Fischer web.de> writes: > > > 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_Number

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

2009-12-29 Thread Will Ness
Eugene Kirpichov gmail.com> writes: > > 2009/12/29 Will Ness yahoo.com>: > > Daniel Fischer web.de> writes: > > > >> > >> > >> 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 P

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

2009-12-29 Thread Eugene Kirpichov
2009/12/29 Will Ness : > Daniel Fischer web.de> writes: > >> >> >> 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 a

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

2009-12-29 Thread Will Ness
Daniel Fischer web.de> writes: > > > 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_Number

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

2009-12-28 Thread Will Ness
Will Ness yahoo.com> writes: > > > wheelSums = roll 0 wdiffs > roll = scanl (+) > wheel = wdiffs ++ wheel > wdiffs = 2:4:2:4:6:2:6:4:2:4:6:6:2:6:4:2:6:4:6:8:4:2:4:2: >4:8:6:4:6:2:4:6:2:6:6:4:2:4:6:2:6:4:2:4:2:10:2:10:wdiffs > Apparently that works too,