vector
Version 0.7.1 revision 0 uploaded by RomanLeshchinskiy.
Package meta
- Synopsis
- Efficient Arrays
- Description
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 in version 0.7.1
New functions:
iterateN
,splitAt
New monadic operations:
generateM
,sequence
,foldM_
and variantsNew functions for copying potentially overlapping arrays:
move
,unsafeMove
Specialisations of various monadic operations for primitive monads
Unsafe casts for Storable vectors
Efficiency improvements
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
andclone
newWith
andnewUnsafeWith
on mutable vectors replaced byreplicate
New function:
concat
New function for safe indexing:
(!?)
Monoid
instances for all vector typesSignificant recycling and fusion improvements
Bug fixes
Support for GHC 7.0
- Author
- Roman Leshchinskiy <rl@cse.unsw.edu.au>
- Bug reports
- http://trac.haskell.org/vector
- Category
- Data, Data Structures
- Copyright
- (c) Roman Leshchinskiy 2008-2011
- Homepage
- http://code.haskell.org/vector
- Maintainer
- Roman Leshchinskiy <rl@cse.unsw.edu.au>
- Package URL
- n/a
- Stability
- n/a