@haskell vector0.5

Efficient Arrays

An efficient implementation of Int-indexed arrays with a powerful loop fusion 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.

Changes since version 0.4.2

  • Unboxed vectors of primitive types and tuples

  • Redesigned interface between mutable and immutable vectors (now with the popular unsafeFreeze primitive)

  • Many new combinators

  • Significant performance improvements