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 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!

Properties

Versions 0.0.0, 0.1.0, 0.1.1, 0.1.2, 1.0.0
Dependencies array (>=0.2 && <0.6), base (==4.*), containers (>=0.2 && <0.6), random (>=1.0.0.1 && <1.2), stm (>=2.1.1.0 && <2.6) [details]
License LGPL
Author Peter Robinson 2010-2014
Maintainer Peter Robinson <thaldyron@gmail.com>
Stability experimental
Category Data, Concurrency
Home page https://github.com/thaldyron/tskiplist
Source repository head: git clone https://github.com/thaldyron/tskiplist
Uploaded Mon May 26 02:59:44 UTC 2014 by PeterRobinson
Distributions NixOS:1.0.0
Downloads 1011 total (10 in the last 30 days)
Votes
0 []
Status Docs available [build log]
Successful builds reported [all 1 reports]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees