Help with a Shootout program
simonmar at microsoft.com
Thu Feb 24 11:25:34 EST 2005
On 24 February 2005 14:47, Carsten Schultz wrote:
> The real performance problem propbably is not O(n) vs. O(n*log n) but
> slow String operations in general. After all, String is a lazy list
> of Char. Have a look at the thread mentioned above, possibly Simon's
> version has become fast again, otherwise it would be an opportuniy to
> reconsider the problems mentioned there.
PackedStrings are still slow in 6.x. I know there are various other
PackedString implementations out there, we just need to incorporate one.
More information about the Glasgow-haskell-users