File: PSQueue.cabal

package info (click to toggle)
haskell-psqueue 1.1-10
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 72 kB
  • sloc: haskell: 360; makefile: 2
file content (23 lines) | stat: -rw-r--r-- 983 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
Name:                PSQueue
Version:             1.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
    Exposed-modules:    Data.PSQueue