stm-containers: Containers for STM

[ concurrency, data-structures, library, mit, stm ] [ Propose Tags ]

This library is based on an STM-specialized implementation of Hash Array Mapped Trie. It provides efficient implementations of Map, Set and other data structures, which starting from version 1 perform even better than their counterparts from "unordered-containers", but also scale well on concurrent access patterns.

For details on performance of the library, which are a bit outdated, see this blog post.

Versions [faq] 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, 0.2.14, 0.2.15, 0.2.16, 1, 1.0.0.1, 1.0.1, 1.0.1.1, 1.1, 1.1.0.1, 1.1.0.2, 1.1.0.3, 1.1.0.4 (info)
Dependencies base (>=4.9 && <5), deferred-folds (==0.9.*), focus (>=1.0.1.3 && <1.1), hashable (<2), list-t (>=1.0.1 && <1.1), stm-hamt (==1.2.*), transformers (==0.5.*) [details]
License MIT
Copyright (c) 2014, Nikita Volkov
Author Nikita Volkov <nikita.y.volkov@mail.ru>
Maintainer Nikita Volkov <nikita.y.volkov@mail.ru>
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 repo head: git clone git://github.com/nikita-volkov/stm-containers.git
Uploaded by NikitaVolkov at Thu Apr 18 19:18:18 UTC 2019
Distributions NixOS:1.1.0.4, Stackage:1.1.0.4
Downloads 15177 total (456 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-04-18 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees