abstract-deque

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

Version on this page:	0.3
LTS Haskell 11.6:	0.3
Stackage Nightly 2018-04-24:	0.3
Latest on Hackage:	0.3

See all snapshots abstract-deque appears in

BSD3 licensed by Ryan R. Newton

Maintained by rrnewton@gmail.com

Module documentation for 0.3

Data
- Data.Concurrent
  - Data.Concurrent.Deque

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.

Depends on 5 packages:

array, base, containers, random, time

Used by 7 packages:

abstract-deque-tests, accelerate-llvm, chaselev-deque, lockfree-queue, meta-par, meta-par-accelerate, monad-par