Abstract, parameterized interface to mutable Deques. https://github.com/rrnewton/haskell-lockfree/wiki

Version on this page:0.3
LTS Haskell 13.25:0.3
Stackage Nightly 2019-06-12:0.3
Latest on Hackage:0.3

See all snapshots abstract-deque appears in

BSD-3-Clause licensed by Ryan R. Newton
Maintained by rrnewton@gmail.com

Module documentation for 0.3

There are no documented modules for this package.

An abstract interface to highly-parameterizable queues/deques.

Background: There exists a feature space for queues that extends between:

  • simple, single-ended, non-concurrent, bounded queues

  • double-ended, threadsafe, growable queues

... with important points inbetween (such as the queues used for work-stealing).

This package includes an interface for Deques that allows the programmer to use a single API for all of the above, while using the type-system to select an efficient implementation given the requirements (using type families).

This package also includes a simple reference implementation based on IORef and Data.Sequence.

comments powered byDisqus