tskiplist: A Skip List Implementation in Software Transactional Memory (STM)
This package provides a proof-of-concept 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.)
Downloads
- tskiplist-1.0.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 && <2), base (>=4.7 && <5), containers (>=0.2 && <1), random (>=1.0.0.1 && <2), stm (>=2.1 && <3) [details] |
| License | LicenseRef-LGPL |
| Copyright | 2010-2019 Peter Robinson |
| Author | Peter Robinson |
| Maintainer | peter.robinson@monoid.at |
| Category | Data, Concurrency |
| Home page | https://github.com/pwrobinson/tskiplist#readme |
| Bug tracker | https://github.com/pwrobinson/tskiplist/issues |
| Source repo | head: git clone https://github.com/pwrobinson/tskiplist |
| Uploaded | by PeterRobinson at 2019-09-24T00:08:24Z |
| Distributions | NixOS:1.0.1 |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 4710 total (11 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2019-09-24 [all 1 reports] |