[Haskell-cafe] ANN: stm-conduit-0.2.1

John Lato jwlato at gmail.com
Mon Feb 13 14:15:13 CET 2012

> Message: 6
> Date: Sun, 12 Feb 2012 01:47:40 -0500
> From: wren ng thornton <wren at freegeek.org>
> Subject: Re: [Haskell-cafe] ANN: stm-conduit-0.2.1
> To: Haskell Cafe <haskell-cafe at haskell.org>
> Message-ID: <4F37608C.3090808 at freegeek.org>
> Content-Type: text/plain; charset=ISO-8859-1; format=flowed
> 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 :)

This is what I did in iteratee-stm.  The stm-chans package is very nice.

(and the results with iteratee-stm were very good as well)

John L.

More information about the Haskell-Cafe mailing list