On Sat, 2008-01-12 at 10:11 -0800, Jonathan Cast wrote: > A nit: the list is almost certainly getting created lazily, or you'd > get more than 300% more memory usage. But you still get the list's > cons cells as your bookkeeping baggage, and they take up space in > exchange for greater flexibility.
But when I'm processing, say, the last directory entry, I have memory allocated for the other 9999 entries that have already been processed, right? I think that's where the 8M vs 2M difference comes from. Andre _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
