Description
A Haskell library for double-ended queues, also known as deques. Deques allow efficient insertion and removal at both the front and the back of a sequence.
Developers use them in schedulers, search algorithms, buffers, work queues, and data-processing pipelines. Correct behavior should be checked for empty queues and alternating front/back operations.