The tskiplist package

[ Tags: concurrency, data, lgpl, 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 and support for efficient range-queries (similarly to Data.Map). In contrast to tree data structures, 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.6), base (>=4 && <4.8), containers (>=0.2 && <0.6), random (>= && <1.2), stm (>= && <2.6) [details]
License LGPL
Author Peter Robinson 2010-2014
Maintainer Peter Robinson <>
Category Data, Concurrency
Home page
Source repo head: git clone
Uploaded Mon May 26 02:59:44 UTC 2014 by PeterRobinson
Updated Thu Mar 23 16:25:27 UTC 2017 by HerbertValerioRiedel to revision 1   [What is this?]
Distributions NixOS:1.0.0
Downloads 1889 total (27 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Successful builds reported [all 1 reports]
Hackage Matrix CI




Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees