tskiplist: A Skip List Implementation in STM

[ concurrency, data, library ] [ Propose Tags ]

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 LicenseRef-LGPL
Author Peter Robinson 2010-2012
Maintainer Peter Robinson <thaldyron@gmail.com>
Category Data, Concurrency
Home page http://darcs.monoid.at/tskiplist
Uploaded by PeterRobinson at Mon Aug 20 03:28:52 UTC 2012
Distributions NixOS:1.0.0
Downloads 2100 total (22 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees