ttrie alternatives and similar packages
Based on the "Concurrency" category.
Alternatively, view ttrie alternatives based on common mentions on social networks and blogs.
-
haxl
A Haskell library that simplifies access to remote data, such as databases or web-based services. -
chaselev-deque
A collection of different packages for CAS based data structures. -
unagi-chan
A haskell library implementing fast and scalable concurrent queues for x86, with a Chan-like API -
libcspm
The library FDR3 uses for parsing, type checking and evaluating machine CSP. -
cspmchecker
The library FDR3 uses for parsing, type checking and evaluating machine CSP. -
lifted-async
Run lifted IO operations asynchronously and wait for their results -
concurrent-machines
Concurrency features for the Haskell machines package -
threads-supervisor
Simple, IO-based Haskell library for Erlang-inspired thread supervisors -
concurrent-supply
A fast globally unique variable supply with a pure API -
slave-thread
A principal solution to ghost threads and silent exceptions -
sirkel
Sirkel; a Chord DHT in haskell. Node failure, replication and batteries included! -
timers
Simple package that implements timers. Both "one-shot" and "repeating" timers are implemented. -
token-bucket
Haskell rate limiter library using lazy token bucket algorithm -
split-channel
Control.Concurrent.Chan split into sending and receiving halves. -
unagi-bloomfilter
A fast, cache-efficient, concurrent bloom filter in Haskell
Clean code begins in your IDE with SonarLint
Do you think we are missing an alternative of ttrie or a related project?
README
A contention-free STM hash map for Haskell.
"Contention-free" means that the map will never cause spurious conflicts. A transaction operating on the map will only ever have to retry if another transaction is operating on the same key at the same time.
This is an implementation of the transactional trie, which is basically a lock-free concurrent hash trie lifted into STM. For a detailed discussion, including an evaluation of its performance, see Chapter 3 of my master's thesis.