{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreieen7h7v5w2gimd4ypq4qbs2l4k65moifk2jd2b5hcfimjqki74ty",
    "uri": "at://did:plc:pi6woz4d47bkuws673w2il2r/app.bsky.feed.post/3mjve4j6wg5b2"
  },
  "path": "/t/ann-stm-ringbuffer/13953#post_1",
  "publishedAt": "2026-04-20T01:42:49.000Z",
  "site": "https://discourse.haskell.org",
  "tags": [
    "Hackage",
    "stm-ringbuffer"
  ],
  "textContent": "Hackage\n\n### stm-ringbuffer\n\nRing buffer implementation in STM\n\nThis is an implementation of a fixed-size ring buffer in STM. As a bounded queue, it outperforms Control.Concurrent.STM.TBQueue in benchmarks. However, it offers a more general interface (you can write / read / flush from both ends)\n\nA module mimicking the interface of Control.Concurrent.STM.TBQueue is provided, so that you can easily substitute it for Control.Concurrent.STM.TBQueue.",
  "title": "[ANN] stm-ringbuffer"
}