[Haskell-cafe] Re: Performance Help

2007-03-19 Thread apfelmus
>> Fusing the ws is trickier. Directly appealing to the fibonacci-number >> example is not recommended because this would mean to keep the last 16 >> ws in memory and shifting them right to left by hand. But as the > > Are you saying this because we don't want a 16-tuple? Exactly. >> "Alternate

[Haskell-cafe] Re: Performance Help

2007-03-19 Thread Dominic Steinitz
Thanks. > Fusing the ws is trickier. Directly appealing to the fibonacci-number > example is not recommended because this would mean to keep the last 16 > ws in memory and shifting them right to left by hand. But as the Are you saying this because we don't want a 16-tuple? > "Alternate method of

[Haskell-cafe] Re: Performance Help

2007-03-12 Thread apfelmus
Dominic Steinitz wrote: > I have re-written the sha1 code so that it is (hopefully) easy to see that it > faithfully implements the algorithm (see > http://www.itl.nist.gov/fipspubs/fip180-1.htm). Having got rid of the space > leak, I have been trying to improve performance. > > Currently, the