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.


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.5.0.1), vector (>=0.10.0.1)
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
Upload dateThu Nov 22 14:27:57 UTC 2012
Uploaded byChristianHoener
Downloads1537 total (109 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees