vector-0.12.0.3: Efficient Arrays

# vector-0.12.0.3: 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

Signatures

Modules

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