The latest version of tskiplist is 1.0.1-0.
tskiplist
Version 1.0.0 revision 0 uploaded by PeterRobinson.
Package meta
- Synopsis
- A Skip List Implementation in Software Transactional Memory (STM)
- Description
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!
- Author
- Peter Robinson 2010-2014
- Bug reports
- n/a
- Category
- Data, Concurrency
- Copyright
- n/a
- Homepage
- https://github.com/thaldyron/tskiplist
- Maintainer
- Peter Robinson <thaldyron@gmail.com>
- Package URL
- n/a
- Stability
- experimental