[Haskell-cafe] Filtering a big list into the IO monad

[Udo Stenzel]

Gabriel Sztorc wrote:
> I want to filter a list with a predicate that returns a IO value, 
> something that filterM is supposed to do. The problem is, filterM 
> overflows the stack for really big lists

Are you sure it's filterM's fault?  Can you post the code in question?
Stack overflows are usually caused by too much lazyness, but for filterM
that doesn't seem to make sense.


Udo.
-- 
<xinkeT> "Lord grant me the serenity to accept the things I cannot
         change, the courage to change the things I can, and the wisdom
	 to hide the bodies of the people I had to kill because
	 they pissed me off."
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: Digital signature
Url : http://www.haskell.org//pipermail/haskell-cafe/attachments/20060803/bc4d3e37/attachment-0001.bin