The tskiplist package
This package provides an implementation of a skip list in STM. A skip list is a probabilistic data structure with map-like operations. In contrast to a balanced tree, a skip list does not need any (expensive) rebalancing operation, which makes it particularly suitable for concurrent programming. See: William Pugh. Skip Lists: A Probabilistic Alternative to Balanced Trees. 1990.
Feedback appreciated!
Properties
| Version | 0.0.0 |
|---|---|
| Dependencies | array (≥0.2 & <0.4), base (4.*), containers (≥0.2 & <0.5), random (≥1.0.0.1 & <1.1), stm (≥2.1.1.0 & <2.2) |
| License | LGPL |
| Author | Peter Robinson 2010 |
| Maintainer | Peter Robinson <thaldyron@gmail.com> |
| Stability | experimental |
| Category | Data, Concurrency |
| Home page | http://darcs.monoid.at/tskiplist |
| Upload date | Wed Nov 24 16:04:40 UTC 2010 |
| Uploaded by | PeterRobinson |
| Built on | ghc-7.0 |
Modules
- Control
- Concurrent
Downloads
- tskiplist-0.0.0.tar.gz (Cabal source package)
- package description (included in the package)