lazy-priority-queue: Lazy-Spined Monadic Priority Queues
This library provides a priority queue data structure that is meant to be used primarily as a control structure, in the vein of list and Logic. The PriorityQueue data structure in question is an instance of Applicative, Alternative, and Monad classes much like the standard list data type. In addition, it also tracks the cost incurred by each computation it stores, and provides operations for pruning overly expansive branches.
Downloads
- lazy-priority-queue-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
Versions [RSS] | 0.1, 0.1.0.1, 0.1.0.2, 0.1.1 |
---|---|
Dependencies | base (<5), containers (>=0.2 && <0.7), lazy-priority-queue [details] |
License | GPL-3.0-only |
Copyright | Stilo International plc |
Author | Mario Blažević |
Maintainer | mblazevic@stilo.com |
Category | Control, Data |
Uploaded | by MarioBlazevic at 2019-09-13T01:07:08Z |
Distributions | |
Executables | Levenshtein |
Downloads | 965 total (6 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2019-09-13 [all 1 reports] |