Actually, that is a moderately fatal flaw. I just uploaded 0.2.2 which
addresses this by highly recommending using bounded channels, as well as
adding sources/sinks for them.
Thanks for catching that!
- clark
On Thu, Feb 9, 2012 at 2:29 PM, Felipe Almeida Lessa wrote: Your package uses TMChans which AFAIK are unbounded. That means that
if the writer is faster than the reader, then everything will be kept
into memory. This means that using TMChans you may no longer say that
your program uses a constant amount of memory. Actually, you lose a
lot of your space reasoning since, being concurrent processes, you
can't guarantee almost anything wrt. progress of the reader. This doesn't mean that your package is broken, this means that it has
a caveat that should be stated on the docs. Congrats on your Hackage debut! Cheers! =) --
Felipe.