The PrimitiveArray package
This library provides efficient multidimensional arrays.
In general all operations are (highly) unsafe, no bounds-checking or other sanity-checking is performed. Operations are aimed toward efficiency as much as possible. Goals of the library are to have arrays according to three ideas: immutablemutable arrays, strictlazy arrays, zero-based/lower-bound arrays. Zero-based arrays save one addition on each access if the lower bound or the array is always zero.
Properties
| Versions | 0.0.2.1, 0.0.2.2, 0.0.3.0, 0.0.3.1, 0.0.4.0, 0.1.1.2, 0.2.0.0, 0.2.1.0, 0.2.1.1, 0.2.2.0, 0.3.0.0, 0.4.0.0, 0.4.0.1, 0.5.0.0 |
|---|---|
| Dependencies | base (4.*), deepseq (≥1.3), primitive (≥0.5.0.1), QuickCheck (≥2.5), repa (≥3.2.3), vector (≥0.10.0.1), vector-th-unbox (≥0.2) |
| License | BSD3 |
| Copyright | Christian Hoener zu Siederdissen, 2010-2013 |
| Author | Christian Hoener zu Siederdissen |
| Maintainer | choener@tbi.univie.ac.at |
| Stability | Experimental |
| Category | Data |
| Home page | http://www.tbi.univie.ac.at/~choener/ |
| Source repository | git clone git://github.com/choener/PrimitiveArray |
| Upload date | Mon Apr 22 00:09:16 UTC 2013 |
| Uploaded by | ChristianHoener |
| Built on | ghc-7.6 |
Modules
Downloads
- PrimitiveArray-0.5.0.0.tar.gz (Cabal source package)
- package description (included in the package)