The tskiplist package

[Tags:lgpl, library]

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!


Versions 0.0.0, 0.1.0, 0.1.1, 0.1.2, 1.0.0
Dependencies array (>=0.2 && <0.5), base (==4.*), containers (>=0.2 && <0.6), random (>= && <1.1), stm (>= && <2.4) [details]
License LGPL
Author Peter Robinson 2010-2012
Maintainer Peter Robinson <>
Stability experimental
Category Data, Concurrency
Home page
Uploaded Wed Jun 6 16:41:00 UTC 2012 by PeterRobinson
Distributions NixOS:1.0.0
Downloads 1029 total (17 in the last 30 days)
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees