The PrimitiveArray package

[Tags: bsd3, library]

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.


Properties

Versions0.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
Dependenciesbase (==4.*), primitive (>=0.4), vector (>=0.9)
LicenseBSD3
CopyrightChristian Hoener zu Siederdissen, 2010-2012
AuthorChristian Hoener zu Siederdissen
Maintainerchoener@tbi.univie.ac.at
StabilityExperimental
CategoryData
Home pagehttp://www.tbi.univie.ac.at/~choener/
Source repositoryhead: git clone git://github.com/choener/PrimitiveArray
UploadedSun Jul 8 00:59:54 UTC 2012 by ChristianHoener
Downloads2079 total (78 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees