The stm-containers package

[Tags:library, mit]

This library is based on an STM-specialized implementation of a Hash Array Mapped Trie. It provides efficient implementations of Map, Set and other data structures, which are slightly slower than their counterparts from "unordered-containers", but scale very well on concurrent access patterns.

For details on performance of the library see this blog post.

Properties

Versions 0.1.0, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2.0, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.2.5, 0.2.6, 0.2.7, 0.2.8, 0.2.9, 0.2.10, 0.2.11, 0.2.13
Dependencies base (<4.10), base-prelude (<2), focus (>=0.1.2 && <0.2), hashable (<2), list-t (>=0.2 && <0.5), primitive (>=0.5 && <0.7), transformers (>=0.3 && <0.6) [details]
License MIT
Copyright (c) 2014, Nikita Volkov
Author Nikita Volkov <nikita.y.volkov@mail.ru>
Maintainer Nikita Volkov <nikita.y.volkov@mail.ru>
Stability Unknown
Category Data Structures, STM, Concurrency
Home page https://github.com/nikita-volkov/stm-containers
Bug tracker https://github.com/nikita-volkov/stm-containers/issues
Source repository head: git clone git://github.com/nikita-volkov/stm-containers.git
Uploaded Tue May 24 05:55:20 UTC 2016 by NikitaVolkov
Distributions LTSHaskell:0.2.13, NixOS:0.2.13, Stackage:0.2.13
Downloads 3904 total (50 in the last 30 days)
Votes
0 []
Status Docs available [build log]
Last success reported on 2016-05-24 [all 1 reports]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees