abstract-deque: Abstract, parameterized interface to mutable Deques.

[ bsd3, data-, library ] [ Propose Tags ]

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.

Flags

Automatic Flags
NameDescriptionDefault
usecas

Enable the reference implementation to use hardware compare-and-swap.

Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 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 array, base (>=4 && <5), containers, HUnit, IORefCAS (>=0.2), random [details]
License BSD-3-Clause
Author Ryan R. Newton
Maintainer rrnewton@gmail.com
Category Data
Home page https://github.com/rrnewton/haskell-lockfree-queue/wiki
Source repo head: git clone git://github.com/rrnewton/haskell-lockfree-queue.git
Uploaded by RyanNewton at 2013-05-07T19:40:18Z
Distributions Arch:0.3, Debian:0.3, Fedora:0.3, FreeBSD:0.3, LTSHaskell:0.3, NixOS:0.3, Stackage:0.3
Reverse Dependencies 8 direct, 3666 indirect [details]
Downloads 60349 total (90 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]