repa 3.2.2.3 → 3.2.2.201204.1
raw patch · 4 files changed
+21/−11 lines, 4 filesdep ~QuickCheckdep ~basedep ~ghc-prim
Dependency ranges changed: QuickCheck, base, ghc-prim, template-haskell
Files
- Data/Array/Repa.hs +11/−4
- Data/Array/Repa/Eval/Gang.hs +1/−1
- Data/Array/Repa/Stencil/Template.hs +1/−1
- repa.cabal +8/−5
Data/Array/Repa.hs view
@@ -1,8 +1,15 @@ {-# OPTIONS -fno-warn-unused-imports #-}--- | Repa arrays are wrappers around a linear structure that holds the element--- data. --- --- The representation tag determines what structure holds the data.+-- | +-- Legacy version for Haskell Platform 2012.04.+--+-- * The Haskell Platform 2012.04 includes GHC 7.4 which does not work with the+-- latest version of LLVM. +--+-- * You will get better performance if you upgrade to the most recent version of GHC.+--+-- Repa arrays are wrappers around a linear structure that holds the element data. +--+-- The representation tag determines what structure holds the data. -- -- Delayed Representations (functions that compute elements) --
Data/Array/Repa/Eval/Gang.hs view
@@ -100,7 +100,7 @@ -- Add finalisers so we can shut the workers down cleanly if they -- become unreachable. zipWithM_ (\varReq varDone - -> mkWeakMVar varReq (finaliseWorker varReq varDone)) + -> addMVarFinalizer varReq (finaliseWorker varReq varDone)) mvsRequest mvsDone
Data/Array/Repa/Stencil/Template.hs view
@@ -92,7 +92,7 @@ $ AppE (VarE (mkName "makeStencil2") `AppE` (LitE (IntegerL sizeX)) `AppE` (LitE (IntegerL sizeY)))- $ LetE [ PragmaD (InlineP (mkName "coeffs") Inline FunLike (BeforePhase 0))+ $ LetE [ PragmaD (InlineP (mkName "coeffs") (InlineSpec True False Nothing)) , ValD (VarP coeffs') (NormalB fnCoeffs) [] ] (VarE (mkName "coeffs"))
repa.cabal view
@@ -1,5 +1,5 @@ Name: repa-Version: 3.2.2.3+Version: 3.2.2.201204.1 License: BSD3 License-file: LICENSE Author: The DPH Team@@ -11,6 +11,9 @@ Homepage: http://repa.ouroborus.net Bug-reports: repa@ouroborus.net Description:+ Legacy version for Haskell Platform 2012.04. You will get better performance+ if you upgrade to the most recent version of GHC.+ Repa provides high performance, regular, multi-dimensional, shape polymorphic parallel arrays. All numeric data is stored unboxed. Functions written with the Repa combinators are automatically parallel provided you supply@@ -21,12 +24,12 @@ Library Build-Depends: - base == 4.6.*,- ghc-prim == 0.3.*,+ base == 4.5.*,+ ghc-prim == 0.2.*, vector == 0.10.*, bytestring == 0.10.*,- template-haskell == 2.8.*,- QuickCheck >= 2.3 && < 2.6+ template-haskell == 2.7.*,+ QuickCheck == 2.4.* ghc-options: -Wall -fno-warn-missing-signatures