lazy-priority-queue: Lazy-Spined Monadic Priority Queues
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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.
Properties
| Versions | 0.1, 0.1, 0.1.0.1, 0.1.0.2, 0.1.1 |
|---|---|
| Change log | None available |
| 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:06:17Z |
Modules
[Index] [Quick Jump]
Downloads
- lazy-priority-queue-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees