I added that after reading his feedback, and seeing the flaw in using TMChans.
On Sun, Feb 12, 2012 at 1:47 AM, wren ng thornton <[email protected]> wrote: > On 2/9/12 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. >> > > Of course, you're free to use TBMChans instead, which are bounded :) > > -- > Live well, > ~wren > > ______________________________**_________________ > Haskell-Cafe mailing list > [email protected] > http://www.haskell.org/**mailman/listinfo/haskell-cafe<http://www.haskell.org/mailman/listinfo/haskell-cafe> > >
_______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
