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.0.2.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 | BSD-3-Clause |
| Copyright | (c) 2019 Stilo International plc |
| Author | Mario Blažević |
| Maintainer | mblazevic@stilo.com |
| Category | Control, Data |
| Bug tracker | https://github.com/blamario/lazy-priority-queue/issues |
| Source repo | head: git clone https://github.com/blamario/lazy-priority-queue |
| Uploaded | by MarioBlazevic at 2021-12-18T14:35:12Z |
| Distributions | |
| Executables | Levenshtein |
| Downloads | 967 total (7 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] All reported builds failed as of 2021-12-18 [all 1 reports] |