kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/devel/hs-vector/Makefile

13 lines
311 B
Makefile
Raw Normal View History

Update to 0.11.0.0 changelog: Changes in version 0.11.0.0 * Define `Applicative` instances for `Data.Vector.Fusion.Util.{Box,Id}` * Define non-bottom `fail` for `instance Monad Vector` * New generalized stream fusion framework * Various safety fixes - Various overflows due to vector size have been eliminated - Memory is initialized on creation of unboxed vectors * Changes to SPEC usage to allow building under more conditions Changes in version 0.10.12.3 * Allow building with `primtive-0.6`
2015-12-13 15:08:12 +01:00
# $NetBSD: Makefile,v 1.6 2015/12/13 14:08:12 szptvlfn Exp $
Import vector-0.10.9.2 as devel/hs-vector, packaged for wip by pho. An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop fusion optimization framework. It is structured as follows: * Data.Vector Boxed vectors of arbitrary types. * Data.Vector.Unboxed Unboxed vectors with an adaptive representation based on data type families. * Data.Vector.Storable Unboxed vectors of Storable types. * Data.Vector.Primitive Unboxed vectors of primitive types as defined by the primitive package. Data.Vector.Unboxed is more flexible at no performance cost. * Data.Vector.Generic Generic interface to the vector types.
2014-05-27 00:02:40 +02:00
Update to 0.11.0.0 changelog: Changes in version 0.11.0.0 * Define `Applicative` instances for `Data.Vector.Fusion.Util.{Box,Id}` * Define non-bottom `fail` for `instance Monad Vector` * New generalized stream fusion framework * Various safety fixes - Various overflows due to vector size have been eliminated - Memory is initialized on creation of unboxed vectors * Changes to SPEC usage to allow building under more conditions Changes in version 0.10.12.3 * Allow building with `primtive-0.6`
2015-12-13 15:08:12 +01:00
DISTNAME= vector-0.11.0.0
Import vector-0.10.9.2 as devel/hs-vector, packaged for wip by pho. An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop fusion optimization framework. It is structured as follows: * Data.Vector Boxed vectors of arbitrary types. * Data.Vector.Unboxed Unboxed vectors with an adaptive representation based on data type families. * Data.Vector.Storable Unboxed vectors of Storable types. * Data.Vector.Primitive Unboxed vectors of primitive types as defined by the primitive package. Data.Vector.Unboxed is more flexible at no performance cost. * Data.Vector.Generic Generic interface to the vector types.
2014-05-27 00:02:40 +02:00
CATEGORIES= devel
MAINTAINER= pho@cielonegro.org
COMMENT= Efficient Arrays for Haskell
LICENSE= modified-bsd
.include "../../mk/haskell.mk"
.include "../../devel/hs-primitive/buildlink3.mk"
.include "../../mk/bsd.pkg.mk"
Reference in a new issue Copy permalink