@haskell vector0.5

Efficient Arrays

Installation
In your cabal file:
Dependencies (3)
- base >=2 && <5
- primitive >=0.2 && <0.3
- ghc >=6.9
Dependents (2361)
@hackage/arbor-datadog, @hackage/tcod-haskell, @hackage/hsndfile-vector, @hackage/timeseries, @hackage/gridland, @hackage/mnist-idx, Show all…

boundschecks

(on by default)

Enable bounds checking

unsafechecks

(off by default)

Enable bounds checking in unsafe operations at the cost of a significant performance penalty

internalchecks

(off by default)

Enable internal consistency checks at the cost of a significant performance penalty

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