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.
We have forked two repa modules: Shape and Index.
Unboxed vectors are available with implementations based on primitive and vector. For some reason, we loose 50% performance with RNAfold if we use vector as the underlying data type, while Nussinov78 does not suffer.
- No changelog available
|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, 0.5.2.0, 0.5.3.0, 0.5.4.0|
|Dependencies||base (==4.*), primitive (>=0.4), vector (>=0.9)|
|Copyright||Christian Hoener zu Siederdissen, 2010-2012|
|Author||Christian Hoener zu Siederdissen|
|Source repository||head: git clone git://github.com/choener/PrimitiveArray|
|Uploaded||Sun Jul 8 00:59:54 UTC 2012 by ChristianHoener|
|Downloads||2380 total (99 in last 30 days)|
|Status||Docs uploaded by user|
Build status unknown [no reports yet]
- PrimitiveArray-0.2.2.0.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees