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

[ control, data, gpl, 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 [RSS] [faq] 0.1, 0.1.0.1, 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 2021-02-18T22:41:34Z
Distributions NixOS:0.1.1
Executables Levenshtein
Downloads 641 total (6 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 2021-02-18 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates