lazy-priority-queue: Lazy-Spined Monadic Priority Queues

[ bsd3, control, data, library, program ] [ Propose Tags ]

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.

Versions [faq] 0.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ć
Category Control, Data
Bug tracker
Source repo head: git clone
Uploaded by MarioBlazevic at 2019-09-19T21:01:09Z
Distributions NixOS:
Executables Levenshtein
Downloads 519 total (5 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-09-19 [all 1 reports]


[Index] [Quick Jump]


Maintainer's Corner

For package maintainers and hackage trustees