Cabal revisions of PSQueue-1.0
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
-Name: PSQueue-Version: 1.0-License: BSD3-License-file: LICENSE-Author: Ralf Hinze-Maintainer: Scott E. Dillard <sedillard@gmail.com>-Stability: Experimental-Synopsis: Priority Search Queue-Description: A /priority search queue/ efficiently supports the- opperations of both a search tree and a priority queue. A- 'Binding' is a product of a key and a priority. Bindings- can be inserted, deleted, modified and queried in- logarithmic time, and the binding with the least priority- can be retrieved in constant time. A queue can be built- from a list of bindings, sorted by keys, in linear time.--Cabal-version: >=1.2-Build-type: Simple-Category: Data Structures--library- Build-Depends: base- Exposed-modules: Data.PSQueue +Name: PSQueue +Version: 1.0 +x-revision: 1 +License: BSD3 +License-file: LICENSE +Author: Ralf Hinze +Maintainer: Scott E. Dillard <sedillard@gmail.com> +Stability: Experimental +Synopsis: Priority Search Queue +Description: A /priority search queue/ efficiently supports the + opperations of both a search tree and a priority queue. A + 'Binding' is a product of a key and a priority. Bindings + can be inserted, deleted, modified and queried in + logarithmic time, and the binding with the least priority + can be retrieved in constant time. A queue can be built + from a list of bindings, sorted by keys, in linear time. + +Cabal-version: >=1.2 +Build-type: Simple +Category: Data Structures + +library + Build-Depends: base >= 4 && < 4.11 + Exposed-modules: Data.PSQueue