The vector package
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 since version 0.5
More efficient representation of Storable vectors
Block copy operations used when possible
Typeable and Data instances
Monadic combinators (replicateM, mapM etc.)
Better support for recycling (see create and modify)
Performance improvements
Properties
| Versions | 0.1, 0.2, 0.3, 0.3.1, 0.4, 0.4.1, 0.4.2, 0.5, 0.6, 0.6.0.1, 0.6.0.2, 0.7, 0.7.0.1, 0.7.1, 0.8, 0.9, 0.9.1, 0.10, 0.10.0.1 |
|---|---|
| Dependencies | base (4.*), ghc (≥6.9), primitive (0.3.*) |
| License | BSD3 |
| Copyright | (c) Roman Leshchinskiy 2008-2010 |
| Author | Roman Leshchinskiy <rl@cse.unsw.edu.au> |
| Maintainer | Roman Leshchinskiy <rl@cse.unsw.edu.au> |
| Category | Data, Data Structures |
| Home page | http://code.haskell.org/vector |
| Bug tracker | http://trac.haskell.org/vector |
| Upload date | Fri Apr 23 12:31:09 UTC 2010 |
| Uploaded by | RomanLeshchinskiy |
| Built on | ghc-6.12 |
| Distributions | Fedora: 0.10.0.1, NixOS: 0.10.0.1, Debian: 0.9.1, FreeBSD: 0.10.0.1 |
Modules
Downloads
- vector-0.6.tar.gz (Cabal source package)
- package description (included in the package)