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!


Versions0.0.0, 0.1.0, 0.1.1, 0.1.2, 1.0.0
Change logNone available
Dependenciesarray (>=0.2 && <0.5), base (==4.*), containers (>=0.2 && <0.6), random (>= && <1.1), stm (>= && <2.4) [details]
AuthorPeter Robinson 2010-2012
MaintainerPeter Robinson <>
CategoryData, Concurrency
Home page
UploadedMon Aug 20 03:28:52 UTC 2012 by PeterRobinson
Downloads793 total (37 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees