Module documentation for 0.4.2
Double-ended priority queues
This library provides a type for ‘DEPQ’s, along with functions for constructing and querying them.
Data.DEPQ module exports the user interface, which is similar to that of most Haskell data container libraries.
Populate a DEPQ (either from a
Foldable collection such as a list or array or by
inserting incrementally) and query either of its extremes (with
Currently the implementation is based on ‘IntPSQ’ (integer-indexed priority search queues) from the ‘psqueues’ package.
Changelog for depq
- add ‘lookup’ , ‘toList’, ‘delete’
- add Foldable instance
- Add test suite ( @HirotoShioi )
- Add ‘size’
- Add dependency lower bounds