repa-algorithms: Algorithms using the Repa array library.

[ bsd3, data-structures, library ] [ Propose Tags ]

NOTE: You must use the GHC head branch > 6.13.20100309 to get decent performance. Reusable algorithms using the Repa array library.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 1.1.0.0, 2.0.0.1, 2.0.0.2, 2.0.0.3, 2.1.0.1, 2.2.0.1, 3.0.0.1, 3.1.0.1, 3.1.3.1, 3.2.1.1, 3.2.2.1, 3.2.2.3, 3.2.2.201204.1, 3.2.3.1, 3.2.4.1, 3.2.5.1, 3.3.1.1, 3.3.1.2, 3.4.0.1, 3.4.0.2, 3.4.1.1, 3.4.1.2, 3.4.1.3, 3.4.1.4, 3.4.1.5
Dependencies base (>=4 && <5), dph-base (>=0.4 && <0.5), repa (>=1.1 && <1.2) [details]
License BSD-3-Clause
Author The DPH Team
Maintainer Ben Lippmeier <benl@ouroborus.net>
Category Data Structures
Home page http://trac.haskell.org/repa
Bug tracker http://trac.haskell.org/repa/newticket
Uploaded by BenLippmeier at 2010-05-07T06:03:31Z
Distributions NixOS:3.4.1.5
Reverse Dependencies 2 direct, 0 indirect [details]
Downloads 22194 total (72 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]