The vector package

[Tags: bsd3, library]

An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop fusion optimization framework .

It is structured as follows:

Boxed vectors of arbitrary types.
Unboxed vectors with an adaptive representation based on data type families.
Unboxed vectors of Storable types.
Unboxed vectors of primitive types as defined by the primitive package. Data.Vector.Unboxed is more flexible at no performance cost.
Generic interface to the vector types.

There is also a (draft) tutorial on common uses of vector.

Please use the project trac to submit bug reports and feature requests.

Changes since version

Changes since version 0.6

Changes since version 0.5


Versions0.1, 0.2, 0.3, 0.3.1, 0.4, 0.4.1, 0.4.2, 0.5, 0.6,,, 0.7,, 0.7.1, 0.8, 0.9, 0.9.1, 0.10,,,,,,,,,,, (info)
Dependenciesbase (>=4.5 && <5), ghc (>=6.9), primitive (==0.3.*)
Copyright(c) Roman Leshchinskiy 2008-2010
AuthorRoman Leshchinskiy <>
MaintainerRoman Leshchinskiy <>
CategoryData, Data Structures
Home page
Bug tracker
UploadedTue Jun 15 03:06:15 UTC 2010 by RomanLeshchinskiy
UpdatedWed Jan 7 09:41:13 UTC 2015 by HerbertValerioRiedel to revision 1
DistributionsDebian:0.9.1, Fedora:, FreeBSD:, LTSHaskell:, NixOS:, Stackage:
Downloads189059 total (1309 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]




boundschecksEnable bounds checkingEnabled
unsafechecksEnable bounds checking in unsafe operations at the cost of a significant performance penaltyDisabled
internalchecksEnable internal consistency checks at the cost of a significant performance penaltyDisabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainers' corner

For package maintainers and hackage trustees