parallel 2.2.0.0 → 2.2.0.1

raw patch · 2 files changed

+4/−6 lines, 2 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Control.Parallel.Strategies: parTraverse :: (Traversable t) => Strategy a -> Strategy (t a)

+ Control.Parallel.Strategies: parTraverse :: Traversable t => Strategy a -> Strategy (t a)

- Control.Parallel.Strategies: rdeepseq :: (NFData a) => Strategy a

+ Control.Parallel.Strategies: rdeepseq :: NFData a => Strategy a

- Control.Parallel.Strategies: rnf :: (NFData a) => a -> ()

+ Control.Parallel.Strategies: rnf :: NFData a => a -> ()

- Control.Parallel.Strategies: seqTraverse :: (Traversable t) => Strategy a -> Strategy (t a)

+ Control.Parallel.Strategies: seqTraverse :: Traversable t => Strategy a -> Strategy (t a)

Control/Parallel/Strategies.hs view

@@ -295,7 +295,7 @@ -- head is demanded. -- -- The idea is to provide a `rolling buffer' of length n.  It is a--- better than 'parList' for a lazy stream, because 'parList' will+-- better than 'parList' for a lazy stream, because p'arList' will -- evaluate the entire list, whereas 'parBuffer' will only evaluate a -- fixed number of elements ahead. @@ -309,11 +309,9 @@ -- than their more general counterparts.  We use RULES to do the -- specialisation. -{- RULES +{-# RULES  "parList/rwhnf" parList rwhnf = parListWHNF-"parList/id"    parList id    = parListWHNF-"parBuffer/rwhnf" forall n . parBuffer n rwhnf = parBufferWHNF n-"parBuffer/id"    forall n . parBuffer n id    = parBufferWHNF n+"parBuffer/rwhnf" forall n . parBuffer n rwhnf = (`using` parBufferWHNF n)  #-}  -- | version of 'parList' specialised to 'rwhnf'.  This version is

parallel.cabal view

@@ -1,5 +1,5 @@ name:		parallel-version:	2.2.0.0+version:	2.2.0.1 license:	BSD3 license-file:	LICENSE maintainer:	libraries@haskell.org