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 very efficient implementations of Map and Set data structures, which are slightly slower than their counterparts from "unordered-containers", but scale very well on concurrent access patterns.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 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, 1.1.0.5, 1.2, 1.2.0.1, 1.2.0.2, 1.2.0.3 (info)
Dependencies base (>=4.5 && <4.8), focus (>0.1.0 && <0.2), hashable (<1.3), loch-th (>=0.2 && <0.3), placeholders (>=0.1 && <0.2), primitive (>=0.5 && <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>
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 2014-06-27T19:00:22Z
Distributions Arch:1.2.0.3, LTSHaskell:1.2.0.3, NixOS:1.2.0.3, Stackage:1.2.0.3
Reverse Dependencies 31 direct, 100 indirect [details]
Downloads 34832 total (238 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Successful builds reported [all 1 reports]