[Haskell] stack overflow - nonobvious thunks?
Chad.Scherrer at pnl.gov
Wed Jul 27 17:19:12 EDT 2005
Adrian, Does your AVL library have an "insertWith'"-type function
mentioned by Udo?
If I lookup and insert into the table separately, forcing evaluation at
each step, I can do
table' :: (Ord a) => [a] -> [(a, Int)]
table' xs = Map.assocs $! foldl' f Map.empty xs
f m x = (Map.insert x $! 1 + Map.findWithDefault 0 x m) $! m
This helps with the stack overflow problem, but now I'm hitting a
*Main> table $ take 10000000 unif
*Main> table $ take 100000000 unif
<interactive>: out of memory (requested 1048576 bytes)
I thought I may have found a good approach using an idea from one of
Amanda Clare's pages
If I write
eqSeq x y = if x==x then y else y
this forces evaluation of x further than seq alone. Then I can write
table :: (Ord a) => [a] -> [(a, Int)]
table xs = Map.assocs $! foldl' f Map.empty xs
f m x = m `eqSeq` Map.insertWith (+) x 1 m
Same result as Udo's suggestion - out of memory.
I still don't see why this function should need any more than a few
kilobytes, even for very large n like this.
From: u.stenzel at web.de [mailto:u.stenzel at web.de]
Sent: Wednesday, July 27, 2005 11:02 AM
To: Scherrer, Chad
Cc: haskell at haskell.org
Subject: Re: [Haskell] stack overflow - nonobvious thunks?
Scherrer, Chad wrote:
> f m x = Map.insertWith (+) x 1 m
insertWith is inserting the "nonobvious thunks". Internally it applies
(+) to the old value and the new one, producing a thunk. There is no
place you could put a seq or something to force the result. You
basically need insertWith', which isn't there.
I think, your best best is to manually lookup the old value, combine
with the new, force the result, then insert that, overwriting the old
On top of that you still need foldl' to avoid building long chains of
The Second Law of Thermodynamics:
If you think things are in a mess now, just wait!
-- Jim Warner
More information about the Haskell