The abstract-deque 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.
Properties
| Versions | 0.1.1, 0.1.4, 0.1.5, 0.1.6, 0.1.7, 0.2 |
|---|---|
| Dependencies | array, base (4.*), containers, HUnit, random |
| License | BSD3 |
| Author | Ryan R. Newton |
| Maintainer | rrnewton@gmail.com |
| Category | Data |
| Home page | https://github.com/rrnewton/haskell-lockfree-queue/wiki |
| Source repository | git clone git://github.com/rrnewton/haskell-lockfree-queue.git |
| Upload date | Tue May 7 19:40:18 UTC 2013 |
| Uploaded by | RyanNewton |
| Built on | ghc-7.6 |
| Distributions | NixOS: 0.2, FreeBSD: 0.1.6 |
Modules
Downloads
- abstract-deque-0.2.tar.gz (Cabal source package)
- package description (included in the package)