# The pqueue-mtl package

Deprecated in favor of queuelike

Contains several implementations of data structures implementing a *single-in, single-out* paradigm,
and implements monad transformers for their safe use. The monad transformer part of the library
includes tools to fully encapsulate single-threaded use of a priority queue in a monad, including an
array-based heap implementation.
In general, the purely functional queue types can be ordered in increasing order of speed on generic insertion/deletion operations
as follows: `Stack`, `Queue`, `PQueue`, `IntQueue`, `SkewQueue`, `FQueue`, `Heap`.
(`PQueue`, `IntQueue`, and `SkewQueue` are all very nearly the same speed.)
Work is in progress on a van Emde Boas
or y-fast priority queue implementation, which provides sublogarithmic functionality for all operations.

- No changelog available

## Properties

Versions | 1.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4, 1.0.5, 1.0.6, 1.0.7 |
---|---|

Dependencies | base, containers, ghc-prim, MaybeT, mtl, stateful-mtl (==1.0.5), uvector |

License | BSD3 |

Author | Louis Wasserman |

Maintainer | wasserman.louis@gmail.com |

Stability | experimental |

Category | Monads, Algorithms |

Bug tracker | mailto:wasserman.louis@gmail.com |

Upload date | Mon Mar 2 15:50:36 UTC 2009 |

Uploaded by | LouisWasserman |

Downloads | 554 total (48 in last 30 days) |

## Modules

*Control**Data*

[Index]

## Downloads

- pqueue-mtl-1.0.6.tar.gz [browse] (Cabal source package)
- Package description (included in the package)

#### Maintainers' corner

For package maintainers and hackage trustees