[Haskell-cafe] Bug-free, leak-free, battle-tested library for broadcast channels?

David Turner dct25-561bs at mythic-beasts.com
Wed Jan 25 08:16:22 UTC 2017

At a high level, it means it does what I think you're looking for: the
"read end" of the channel created there isn't connected to anything, so
there's no leak if there's no consumers. But duplicating it gives you a new
"read end" that yields values as you would expect.

Without going into too much detail about STM, everything runs in a
transaction, and `retry` means to roll back any changes within the
transaction and start again. An unconditional `retry` (including
unconditionally reading from a channel created with `newBroadcastTChan`) is
a deadlock and therefore probably a mistake. So don't do that!

On 25 Jan 2017 05:41, "Saurabh Nanda" <saurabhnanda at gmail.com> wrote:

The implementation in STM works well and certainly ticks the battle-tested
> box:
> https://hackage.haskell.org/package/stm-
> -Concurrent-STM-TChan.html#v:newBroadcastTChan

What does the following comment in the documentation really mean
(highlighted by >>><<<)?

"Create a write-only TChan
>>> More precisely, readTChan
 will retry
 even after items have been written to the channel.<<< The only way to read
a broadcast channel is to duplicate it with dupTChan

-- Saurabh.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20170125/17d98838/attachment.html>

More information about the Haskell-Cafe mailing list