tskiplist: A Skip List Implementation in STM
This package provides an implementation of a skip list in STM. A skip list is a probabilistic data structure with dictionary operations (similarly to Data.Map). In contrast to a balanced tree, 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-0.1.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
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.5), base (>=4 && <5), containers (>=0.2 && <0.6), random (>=1.0.0.1 && <1.1), stm (>=2.1.1.0 && <2.4) [details] |
| License | LicenseRef-LGPL |
| Author | Peter Robinson 2010-2012 |
| Maintainer | Peter Robinson <thaldyron@gmail.com> |
| Category | Data, Concurrency |
| Home page | http://darcs.monoid.at/tskiplist |
| Uploaded | by PeterRobinson at 2012-07-07T08:18:41Z |
| Distributions | NixOS:1.0.1 |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 4586 total (18 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |