@haskell vector0.7.0.1

Efficient Arrays

Installation
In your cabal file:
Dependencies (2)
- base >=4 && <5
- primitive >=0.3.1 && <0.4
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 (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.

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

Changes in version 0.7.0.1

Changes in version 0.7

New functions for freezing, copying and thawing vectors: freeze, thaw, unsafeThaw and clone
newWith and newUnsafeWith on mutable vectors replaced by replicate
New function: concat
New function for safe indexing: (!?)
Monoid instances for all vector types
Significant recycling and fusion improvements
Bug fixes
Support for GHC 7.0