tskiplist: A Skip List Implementation in Software Transactional Memory (STM)
This package provides an implementation of a skip list in STM. A skip list is a probabilistic data structure with dictionary operations and support for efficient range-queries (similarly to Data.Map). In contrast to tree data structures, a skip list does not need any rebalancing, which makes it particularly suitable for concurrent programming. See: William Pugh. Skip Lists: A Probabilistic Alternative to Balanced Trees.
Feedback appreciated!
Downloads
- tskiplist-1.0.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.0.0, 0.1.0, 0.1.1, 0.1.2, 1.0.0, 1.0.1 |
|---|---|
| Dependencies | array (>=0.2 && <0.6), base (>=4 && <4.8), containers (>=0.2 && <0.6), random (>=1.0.0.1 && <1.2), stm (>=2.1.1.0 && <2.6) [details] |
| License | LicenseRef-LGPL |
| Author | Peter Robinson 2010-2014 |
| Maintainer | Peter Robinson <thaldyron@gmail.com> |
| Revised | Revision 1 made by HerbertValerioRiedel at 2017-03-23T16:25:27Z |
| Category | Data, Concurrency |
| Home page | https://github.com/thaldyron/tskiplist |
| Source repo | head: git clone https://github.com/thaldyron/tskiplist |
| Uploaded | by PeterRobinson at 2014-05-26T02:59:44Z |
| Distributions | NixOS:1.0.1 |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 4589 total (20 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Successful builds reported [all 1 reports] |