On Wed, Dec 15, 2010 at 7:59 AM, Simon Marlow <marlo...@gmail.com> wrote: > > The -M flag causes the GC algorithm to switch from copying (fast but > hungry) to compaction (slow but frugal) as the limit approaches.
Ah, so that's what it's doing. My measurements say that part of the code is working well. Of course, my conclusion is based on a tiny sample size. John _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
