storablevector 0.2.13 → 0.2.13.1

raw patch · 2 files changed

+7/−6 lines, 2 filesdep ~bytestringdep ~randomdep ~transformers

Dependency ranges changed: bytestring, random, transformers

Files

• src/Data/StorableVector.hs +2/−1
• storablevector.cabal +5/−5

@@ -904,7 +904,8 @@   -- | /O(n)/ 'iterateN' @n f x@ is a 'Vector' of length @n@--- where the elements of @x@ are generated by repeated application of @f@.+-- where the elements are generated by repeated application of @f@,+-- starting at @x@. -- iterateN :: (Storable a) => Int -> (a -> a) -> a -> Vector a iterateN n f =

@@ -1,5 +1,6 @@+Cabal-Version:       2.2 Name:                storablevector-Version:             0.2.13+Version:             0.2.13.1 Category:            Data Synopsis:            Fast, packed, strict storable arrays with a list interface like ByteString Description:@@ -18,7 +19,7 @@     this would either be incorrect or not applicable.     However we provide fusion with lazy lists in the package     <http://hackage.haskell.org/package/storablevector-streamfusion>.-License:             BSD3+License:             BSD-3-Clause License-file:        LICENSE Author:              Spencer Janssen <sjanssen@cse.unl.edu>, Henning Thielemann <storablevector@henning-thielemann.de> Maintainer:          Henning Thielemann <storablevector@henning-thielemann.de>@@ -28,7 +29,6 @@ Tested-With:         GHC==6.8.2, GHC==6.12.3 Tested-With:         GHC==7.4.1, GHC==7.6.2, GHC==7.8.2 Tested-With:         JHC==0.7.3-Cabal-Version:       1.14 Extra-Source-Files:   foreign-ptr/fast/Data/StorableVector/Memory.hs   foreign-ptr/slow/Data/StorableVector/Memory.hs@@ -48,7 +48,7 @@ Source-Repository this   type:     darcs   location: http://code.haskell.org/storablevector/-  tag:      0.2.13+  tag:      0.2.13.1   Library@@ -125,7 +125,7 @@     QuickCheck >=1 && <3   If flag(splitBase)     Build-Depends:-      random >=1.0 && <1.2,+      random >=1.0 && <1.3,       base >=3 && <5   Else     Build-Depends:     base >=1.0 && <2