[Haskell-cafe] ANN: tskiplist-0.0.0
thaldyron at gmail.com
Thu Nov 25 08:49:29 CET 2010
This package  provides an implementation of a skip list using STM.
A skip list
is a probabilistic data structure with Data.Map-like operations. In contrast
to a balanced tree, a skip list does not need any (expensive) rebalancing,
which makes it particularly suitable for concurrent programming.
You can find some documentation on how to use it here:
More information about the Haskell-Cafe