vector-0.13.2.0: Efficient Arrays

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

Modules

vector-0.13.2.0

- Bench
  Submodules
  - Vector
    Submodules
    - Algo
      Submodules
      - Bench.Vector.Algo.AwShCC
      - Bench.Vector.Algo.FindIndexR
      - Bench.Vector.Algo.HybCC
      - Bench.Vector.Algo.Leaffix
      - Bench.Vector.Algo.ListRank
      - Bench.Vector.Algo.MutableSet
      - Bench.Vector.Algo.NextPermutation
      - Bench.Vector.Algo.Quickhull
      - Bench.Vector.Algo.Rootfix
      - Bench.Vector.Algo.Spectral
      - Bench.Vector.Algo.Tridiag
    - Bench.Vector.Tasty
    - TestData
      Submodules
      - Bench.Vector.TestData.Graph
      - Bench.Vector.TestData.ParenTree