vector-0.7.0.1: Efficient Arrays

| vector-0.7.0.1: Efficient Arrays | Contents | Index
vector-0.7.0.1: Efficient Arrays
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. 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.7.0.1 Dependency on package ghc removed 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
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 |  |
Produced by Haddock version 2.7.2