stm-hamt: STM-specialised Hash Array Mapped Trie

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

A low-level data-structure, which can be used to implement higher-level interfaces like hash-map and hash-set. Such implementations are presented by the "stm-containers" library.

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 1, 1.1, 1.1.0.1, 1.1.1, 1.1.2, 1.1.2.1, 1.2, 1.2.0.1, 1.2.0.2, 1.2.0.3, 1.2.0.4, 1.2.0.5, 1.2.0.6, 1.2.0.7, 1.2.0.8
Dependencies base (>=4.9 && <5), deferred-folds (>=0.9 && <0.10), focus (>=1 && <1.1), hashable (<2), list-t (>=1.0.1 && <1.1), primitive (>=0.7 && <0.8), primitive-extras (>=0.10 && <0.11), transformers (>=0.5 && <0.6) [details]
License MIT
Copyright (c) 2016, 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-hamt
Bug tracker https://github.com/nikita-volkov/stm-hamt/issues
Uploaded by NikitaVolkov at 2022-08-13T05:54:13Z
Distributions Arch:1.2.0.8, LTSHaskell:1.2.0.8, NixOS:1.2.0.8, Stackage:1.2.0.8
Downloads 12561 total (224 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2022-08-13 [all 1 reports]