cabal-version: >=1.10 name: lazy-priority-queue version: 0.1.1 synopsis: Lazy-Spined Monadic Priority Queues description: 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. -- bug-reports: license: GPL-3 license-file: LICENSE author: Mario Blažević maintainer: mblazevic@stilo.com copyright: Stilo International plc category: Control, Data build-type: Simple --extra-source-files: CHANGELOG.md Library default-language: Haskell2010 exposed-modules: Data.PriorityQueue build-depends: base < 5 hs-source-dirs: src Executable Levenshtein default-language: Haskell2010 main-is: Levenshtein.hs build-depends: base < 5, containers >= 0.2 && < 0.7, lazy-priority-queue test-suite doctests type: exitcode-stdio-1.0 hs-source-dirs: test default-language: Haskell2010 main-is: Doctest.hs ghc-options: -threaded -pgmL markdown-unlit build-depends: base, lazy-priority-queue, lens, doctest >= 0.8 build-tool-depends: markdown-unlit:markdown-unlit >= 0.5 && < 0.6