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

[ bsd3, 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 [faq] 0.1, 0.1.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ć
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 Thu Sep 19 21:01:09 UTC 2019
Distributions NixOS:0.1.0.1
Executables Levenshtein
Downloads 120 total (35 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-09-19 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees