The tskiplist package
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!
Properties
| Versions | 0.0.0, 0.1.0, 0.1.1, 0.1.2 |
|---|---|
| Dependencies | array (≥0.2 & <0.5), base (4.*), containers (≥0.2 & <0.6), random (≥1.0.0.1 & <1.1), stm (≥2.1.1.0 & <2.4) |
| License | LGPL |
| Author | Peter Robinson 2010-2012 |
| Maintainer | Peter Robinson <thaldyron@gmail.com> |
| Stability | experimental |
| Category | Data, Concurrency |
| Home page | http://darcs.monoid.at/tskiplist |
| Upload date | Mon Aug 20 03:28:52 UTC 2012 |
| Uploaded by | PeterRobinson |
| Built on | ghc-7.4 |
Modules
- Control
- Concurrent
Downloads
- tskiplist-0.1.2.tar.gz (Cabal source package)
- package description (included in the package)