           SPELL=haskell-abstract-deque
         VERSION=0.3
          SOURCE="abstract-deque-${VERSION}.tar.gz"
   SOURCE_URL[0]=https://hackage.haskell.org/package/abstract-deque-${VERSION}/${SOURCE}
     SOURCE_HASH=sha512:9293a366918f54458ffe13f6737bab2bee961b730732eff563d900b451bf5f7dde30276c9406bfc5c0ea64104afb70db3588b13d478bf9c60842dad906195f7a
SOURCE_DIRECTORY="${BUILD_DIRECTORY}/abstract-deque-${VERSION}"
        WEB_SITE="https://github.com/rrnewton/haskell-lockfree/wiki"
      LICENSE[0]=BSD
         ENTERED=20180131
           SHORT="an abstract interface to highly-parameterizable queues/deques"
cat << EOF
Please enter a description of the spell here


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.
EOF
