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
IORef and Data.Sequence.
|Versions||0.1.1, 0.1.4, 0.1.5, 0.1.6, 0.1.7, 0.2, 0.2.2, 0.2.2.1, 0.3|
|Dependencies||base (==4.*), containers, HUnit, IORefCAS (>=0.2) [details]|
|Author||Ryan R. Newton|
|Uploaded||Sat Jan 7 10:40:56 UTC 2012 by RyanNewton|
|Distributions||Arch:0.3, Debian:0.3, Fedora:0.3, FreeBSD:0.3, LTSHaskell:0.3, NixOS:0.3, Stackage:0.3, openSUSE:0.3|
|Downloads||37783 total (199 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
For package maintainers and hackage trustees