vector-0.10.0.1: Efficient Arrays

# vector-0.10.0.1: Efficient Arrays

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

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

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

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

Modules

- Data
  - Data.Vector
    - Fusion
      - Data.Vector.Fusion.Stream
        - Data.Vector.Fusion.Stream.Monadic
        - Data.Vector.Fusion.Stream.Size
      - Data.Vector.Fusion.Util
    - Data.Vector.Generic
      - Data.Vector.Generic.Mutable
      - Data.Vector.Generic.New
    - Internal
      - Data.Vector.Internal.Check
    - Data.Vector.Mutable
    - Data.Vector.Primitive
      - Data.Vector.Primitive.Mutable
    - Data.Vector.Storable
      - Data.Vector.Storable.Internal
      - Data.Vector.Storable.Mutable
    - Data.Vector.Unboxed
      - Data.Vector.Unboxed.Mutable