On Fri, Oct 14, 2005 at 04:29:37PM +0100, Simon Marlow wrote:
> I'm not certain that this is your problem, but hash tables are by
> definition mutable objects, and mutable objects don't work too well with
> generational garbage collection, GHC's in particular. Basically every
> GC, even the minor ones, will have to scan all the mutable objects.
Does this mean it will take time proportional to the number of mutable
objects, or the size of everything pointed to by a mutable object? like
, will I save GC time by having an IORef pointing to a Map rather than
a large mutable Array?
John
--
John Meacham - ⑆repetae.net⑆john⑈
_______________________________________________
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
