freebsd-ports/devel/hs-unordered-containers/Makefile

# New ports collection makefile for:	hs-unordered-containers
# Date created:		July 30, 2011
# Whom:			haskell@FreeBSD.org
#
# $FreeBSD$
#

PORTNAME=	unordered-containers
PORTVERSION=	0.2.1.0
PORTREVISION=	1
CATEGORIES=	devel haskell

MAINTAINER=	haskell@FreeBSD.org
COMMENT=	Efficient hashing-based container types

LICENSE=	BSD

CABAL_SETUP=	Setup.hs

USE_CABAL=	hashable>=1.0.1.1

.include "${.CURDIR}/../../lang/ghc/bsd.cabal.mk"
.include <bsd.port.mk>
Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed. The declared cost of each operation is either worst-case or amortized, but remains valid even if structures are shared. WWW: http://github.com/tibbe/unordered-containers/ Obtained from: FreeBSD Haskell 2011-08-14 19:52:20 +02:00			`# New ports collection makefile for: hs-unordered-containers`
			`# Date created: July 30, 2011`
			`# Whom: haskell@FreeBSD.org`
			`#`
			`# $FreeBSD$`
			`#`

			`PORTNAME= unordered-containers`
- Update to 0.2.1.0 Obtained from: FreeBSD Haskell 2012-06-04 00:02:33 +02:00			`PORTVERSION= 0.2.1.0`
- Teach the Haskell Cabal ports to use the new options framework - Remove some cruft Obtained from: FreeBSD Haskell 2012-08-03 04:30:07 +02:00			`PORTREVISION= 1`
Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed. The declared cost of each operation is either worst-case or amortized, but remains valid even if structures are shared. WWW: http://github.com/tibbe/unordered-containers/ Obtained from: FreeBSD Haskell 2011-08-14 19:52:20 +02:00			`CATEGORIES= devel haskell`

			`MAINTAINER= haskell@FreeBSD.org`
			`COMMENT= Efficient hashing-based container types`

			`LICENSE= BSD`

			`CABAL_SETUP= Setup.hs`
- Update to 0.2.1.0 Obtained from: FreeBSD Haskell 2012-06-04 00:02:33 +02:00
			`USE_CABAL= hashable>=1.0.1.1`
Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed. The declared cost of each operation is either worst-case or amortized, but remains valid even if structures are shared. WWW: http://github.com/tibbe/unordered-containers/ Obtained from: FreeBSD Haskell 2011-08-14 19:52:20 +02:00
			`.include "${.CURDIR}/../../lang/ghc/bsd.cabal.mk"`
			`.include <bsd.port.mk>`