161cdfdab6
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. WWW: http://hackage.haskell.org/package/PSQueue Obtained from: FreeBSD Haskell
18 lines
363 B
Makefile
18 lines
363 B
Makefile
# New ports collection makefile for: hs-PSQueue
|
|
# Date created: September 20, 2010
|
|
# Whom: haskell@FreeBSD.org
|
|
#
|
|
# $FreeBSD$
|
|
#
|
|
|
|
PORTNAME= PSQueue
|
|
PORTVERSION= 1.1
|
|
CATEGORIES= devel haskell
|
|
|
|
MAINTAINER= haskell@FreeBSD.org
|
|
COMMENT= Priority Search Queue
|
|
|
|
LICENSE= BSD
|
|
|
|
.include "${.CURDIR}/../../lang/ghc/bsd.cabal.mk"
|
|
.include <bsd.port.mk>
|