Contention-free STM hash map
|Version on this page:||0.1.2.1|
|LTS Haskell 20.23:||0.1.2.2|
|Stackage Nightly 2023-05-31:||0.1.2.2|
|Latest on Hackage:||0.1.2.2|
Maintained by firstname.lastname@example.org
This version can be pinned in stack with:
Module documentation for 0.1.2.1
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.
0.1.2.1 (November 2015)
* Eliminate a redundant import warning on GHC 7.10 * Loosen test-suite dependency bounds
0.1.2 (May 2015)
* Add a 'member' convenience function
0.1.1 (April 2015)
* Add 'fromList' and 'unsafeToList' functions * Add basic tests