-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathPSQueue.cabal
31 lines (28 loc) · 1.24 KB
/
PSQueue.cabal
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
cabal-version: 2.0
name: PSQueue
version: 1.1.0.1
build-type: Simple
license: BSD3
license-file: LICENSE
author: Ralf Hinze
maintainer: Hackage Trustees <[email protected]>
bug-reports: https://github.com/hackage-trustees/PSQueue/issues
synopsis: Priority Search Queue
category: Data Structures
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.
extra-source-files: ChangeLog.md
source-repository head
type: git
location: https://github.com/hackage-trustees/PSQueue.git
library
exposed-modules: Data.PSQueue
default-language: Haskell2010
if impl(ghc > 7.2)
default-extensions: Safe
build-depends: base >= 4.3 && < 4.13