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.

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

• http://haskell.org/haskellwiki/Numeric_Haskell:_A_Vector_Tutorial

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

• http://trac.haskell.org/vector

Changes since version 0.6

• Improved documentation

Changes since version 0.5

• More efficient representation of Storable vectors
• Block copy operations used when possible
• Typeable and Data instances
• Monadic combinators (replicateM, mapM etc.)
• Better support for recycling (see create and modify)
• Performance improvements