tskiplist
Version 1.0.1 revision 0 uploaded by PeterRobinson.
Package meta
- Synopsis
- A Skip List Implementation in Software Transactional Memory (STM)
- Description
This package provides a proof-of-concept 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.)
- Author
- Peter Robinson
- Bug reports
- https://github.com/pwrobinson/tskiplist/issues
- Category
- Data, Concurrency
- Copyright
- 2010-2019 Peter Robinson
- Homepage
- https://github.com/pwrobinson/tskiplist#readme
- Maintainer
- peter.robinson@monoid.at
- Package URL
- n/a
- Stability
- n/a