abstract, parameterized interface to mutable Deques; documentation
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.
This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
|License||Verified by||Verified on||Notes|
|License:BSD 3Clause||Debian: Clint Adams <firstname.lastname@example.org>||12 August 2014|
Leaders and contributors
|Ryan R. Newton||contact|
Resources and communication
|Debian (Ref) (R)||https://tracker.debian.org/pkg/haskell-abstract-deque|
This entry (in part or in whole) was last reviewed on 8 March 2018.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.