stm-containers
stm-queue-extras
| stm-containers | stm-queue-extras | |
|---|---|---|
| 3 | - | |
| 68 | 0 | |
| - | - | |
| 4.1 | 0.0 | |
| 3 months ago | about 10 years ago | |
| Haskell | Haskell | |
| MIT License | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
stm-containers
-
Concurrency in Haskell: Fast, Simple, Correct
https://hackage.haskell.org/package/stm-containers
This library is full of STM-oriented data structures. They perform better than a simple `TVar (Map k v)`.
It's kind of a fun trick actually. The stock Map is just a tree. The STM Map is also a tree but with TVars at each node. So this helps a lot with contention - you only contend along a "spine" instead of across the whole tree, which is O(log n).
-
Software Transactional Memory (1997)
I think you are right about STM being roughly equivalent to snapshot isolation.
What STM offers is an easy way to invent "containers for snapshotted values" aka TVars. Using them carefully may result in better scaling: https://hackage.haskell.org/package/stm-containers
-
How to achieve "Run at most one parallel async action per user"?
how about use stm-containers?
stm-queue-extras
We haven't tracked posts mentioning stm-queue-extras yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
theatre - Minimalistic actor library for Haskell
named-lock - A named lock that is created on demand.
restricted-workers - Interactive-diagrams
stm-chunked-queues - Thread communication queues that group items/requests that occur close together in time
stm-conduit - STM-based channels for conduits.