So I downloaded the new Data.Map and Data.Set and ran the code I posted before. I executed basically instantly and used minimal memory.
I think Map picked up a lot of speed because it doesn't spaceleak, but am not sure.
-Alex-
On Tue, 25 Jan 2005, Ketil Malde wrote:
"S. Alexander Jacobson" <[EMAIL PROTECTED]> writes:
Just did a search after my last post and learned that FiniteMap is bad. Discoverd that Data.Map is the intended replacement. Downloaded it and modified it to work with 6.2. Blazingly fast!
Oh? I was aware that Data.Map was supposed to be better, but not that FiniteMap was particularly bad. Is there any information about when, why and by how much Data.Map is better?
-kzm -- If I haven't seen further, it is by standing in the footprints of giants
______________________________________________________________ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
