An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation 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

Changes in version 0.10.0.1

• Require primitive to include workaround for a GHC array copying bug

Changes in version 0.10

• NFData instances

• More efficient block fills

• Safe Haskell support removed

---

[Skip to Readme]

Modules

[Index]

Flags

Automatic Flags

Name	Description	Default
boundschecks	Enable bounds checking	Enabled
unsafechecks	Enable bounds checking in unsafe operations at the cost of a significant performance penalty	Disabled
internalchecks	Enable internal consistency checks at the cost of a significant performance penalty	Disabled

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

Downloads

• vector-0.10.9.0.tar.gz [browse] (Cabal source package)
• Package description (revised from the package)

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

• AlexeyKhudyakov, lehins, Bodigrim, topos

For package maintainers and hackage trustees

• edit package information

Candidates

• No Candidates