vector: Efficient Arrays
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
Warnings:
- 'ghc-options: -O2' is rarely needed. Check that it is giving a real benefit and not just imposing longer compile times on your users.
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
Storabletypes. - Data.Vector.Primitive
- Unboxed vectors of primitive types as
defined by the
primitivepackage. 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.
[Skip to Readme]
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, 0.10.9.0, 0.10.9.1, 0.10.9.2, 0.10.9.3, 0.10.10.0, 0.10.11.0, 0.10.12.0, 0.10.12.1, 0.10.12.2, 0.10.12.3, 0.11.0.0, 0.12.0.0, 0.12.0.1, 0.12.0.1, 0.12.0.2, 0.12.0.3, 0.12.1.0, 0.12.1.1, 0.12.1.2, 0.12.2.0, 0.12.3.0 |
|---|---|
| Change log | changelog |
| Dependencies | base (>=4.5 && <4.10), deepseq (>=1.1 && <1.5), ghc-prim (>=0.2 && <0.6), primitive (>=0.5.0.1 && <0.7), semigroups (==0.18.*) [details] |
| License | BSD-3-Clause |
| Copyright | (c) Roman Leshchinskiy 2008-2012 |
| Author | Roman Leshchinskiy <rl@cse.unsw.edu.au> |
| Maintainer | Haskell Libraries Team <libraries@haskell.org> |
| Category | Data, Data Structures |
| Home page | https://github.com/haskell/vector |
| Bug tracker | https://github.com/haskell/vector/issues |
| Source repo | head: git clone https://github.com/haskell/vector.git |
| Uploaded | by DanDoel at 2017-03-13T03:06:22Z |
Modules
[Index]
- Data
- Data.Vector
- Fusion
- Data.Vector.Generic
- Data.Vector.Generic.Base
- Data.Vector.Generic.Mutable
- Data.Vector.Generic.New
- Internal
- Data.Vector.Mutable
- Data.Vector.Primitive
- Data.Vector.Storable
- Data.Vector.Unboxed
- Data.Vector.Unboxed.Base
- Data.Vector.Unboxed.Mutable
- Data.Vector
Flags
| Name | Description | Default | Type |
|---|---|---|---|
| boundschecks | Enable bounds checking | Enabled | Manual |
| unsafechecks | Enable bounds checking in unsafe operations at the cost of a significant performance penalty | Disabled | Manual |
| internalchecks | Enable internal consistency checks at the cost of a significant performance penalty | Disabled | Manual |
| wall | Enable all -Wall warnings | Disabled | Manual |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- vector-0.12.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Readme for vector-0.12.0.1
[back to package description]The vector package 
An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework.
See vector on Hackage for more information.