PrimitiveArray: Efficient multidimensional arrays

[ bsd3, data, library ] [ Propose Tags ]

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". The "primitive" version is probably obsolete now, as I don't see any slowdowns anymore. If this continues into GHC 7.6.1, I'll remove the old code (This will probably not break user code using Unboxed.Zero).

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

Versions [RSS] 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, 0.6.0.0, 0.6.1.0, 0.7.0.0, 0.7.0.1, 0.7.1.0, 0.8.0.0, 0.8.0.1, 0.9.0.0, 0.9.1.0, 0.9.1.1, 0.10.0.0, 0.10.1.0, 0.10.1.1
Dependencies base (>=4 && <5), primitive (>=0.4), vector (>=0.9) [details]
License BSD-3-Clause
Copyright Christian Hoener zu Siederdissen, 2010-2012
Author Christian Hoener zu Siederdissen
Maintainer choener@tbi.univie.ac.at
Category Data
Home page http://www.tbi.univie.ac.at/~choener/
Source repo head: git clone git://github.com/choener/PrimitiveArray
Uploaded by ChristianHoener at 2012-08-30T14:07:32Z
Distributions LTSHaskell:0.10.1.1, NixOS:0.10.1.1
Downloads 23328 total (11 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]