arithmoi 0.4.1.0 → 0.4.1.1

raw patch · 8 files changed

+16/−10 lines, 8 filesdep ~mtldep ~randomPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: mtl, random

API changes (from Hackage documentation)

Files

• Math/NumberTheory/MoebiusInversion.hs +1/−1
• Math/NumberTheory/MoebiusInversion/Int.hs +1/−1
• Math/NumberTheory/Powers/Cubes.hs +1/−1
• Math/NumberTheory/Powers/Fourth.hs +1/−1
• Math/NumberTheory/Powers/Squares.hs +1/−1
• Math/NumberTheory/Primes/Counting/Impl.hs +1/−1
• Math/NumberTheory/Primes/Sieve/Eratosthenes.hs +1/−1
• arithmoi.cabal +9/−3

@@ -8,7 +8,7 @@ -- -- Generalised Moebius inversion ---{-# LANGUAGE BangPatterns #-}+{-# LANGUAGE BangPatterns, FlexibleContexts #-} module Math.NumberTheory.MoebiusInversion     ( generalInversion     , totientSum

@@ -8,7 +8,7 @@ -- -- Generalised Moebius inversion for 'Int' valued functions. ---{-# LANGUAGE BangPatterns #-}+{-# LANGUAGE BangPatterns, FlexibleContexts #-} {-# OPTIONS_GHC -fspec-constr-count=8 #-} module Math.NumberTheory.MoebiusInversion.Int     ( generalInversion

@@ -8,7 +8,7 @@ -- -- Functions dealing with cubes. Moderately efficient calculation of integer -- cube roots and testing for cubeness.-{-# LANGUAGE MagicHash, BangPatterns, CPP #-}+{-# LANGUAGE MagicHash, BangPatterns, CPP, FlexibleContexts #-} module Math.NumberTheory.Powers.Cubes     ( integerCubeRoot     , integerCubeRoot'

@@ -8,7 +8,7 @@ -- -- Functions dealing with fourth powers. Efficient calculation of integer fourth -- roots and efficient testing for being a square's square.-{-# LANGUAGE MagicHash, CPP #-}+{-# LANGUAGE MagicHash, CPP, FlexibleContexts #-} module Math.NumberTheory.Powers.Fourth     ( integerFourthRoot     , integerFourthRoot'

@@ -8,7 +8,7 @@ -- -- Functions dealing with squares. Efficient calculation of integer square roots -- and efficient testing for squareness.-{-# LANGUAGE MagicHash, BangPatterns, CPP #-}+{-# LANGUAGE MagicHash, BangPatterns, CPP, FlexibleContexts #-} module Math.NumberTheory.Powers.Squares     ( -- * Square root calculation       integerSquareRoot

@@ -8,7 +8,7 @@ -- -- Number of primes not exceeding @n@, @π(n)@, and @n@-th prime. ---{-# LANGUAGE CPP, BangPatterns #-}+{-# LANGUAGE CPP, BangPatterns, FlexibleContexts #-} #if __GLASGOW_HASKELL__ >= 700 {-# OPTIONS_GHC -fspec-constr-count=24 #-} #endif

@@ -8,7 +8,7 @@ -- -- Sieve ---{-# LANGUAGE CPP, BangPatterns #-}+{-# LANGUAGE CPP, BangPatterns, FlexibleContexts #-} #if __GLASGOW_HASKELL__ >= 700 {-# OPTIONS_GHC -fspec-constr-count=8 #-} #endif

@@ -1,5 +1,5 @@ name                : arithmoi-version             : 0.4.1.0+version             : 0.4.1.1 cabal-version       : >= 1.6 author              : Daniel Fischer copyright           : (c) 2011 Daniel Fischer@@ -27,14 +27,18 @@  category            : Math, Algorithms, Number Theory -tested-with         : GHC == 7.4.2, GHC==7.6.3, GHC==7.8.1+tested-with         : GHC == 7.4.2, GHC==7.6.3, GHC==7.8.3  extra-source-files  : Changes, TODO +Flag llvm+    Description         : Compile the library with the llvm backend+    Default             : True+ library     build-depends       : base >= 4 && < 5, array >= 0.3 && < 0.6, ghc-prim,                           integer-gmp, containers >= 0.3 && < 0.6, random >= 1.0 && < 1.1,-                          mtl >= 2.0 && < 2.2+                          mtl >= 2.0 && < 2.3     exposed-modules     : Math.NumberTheory.Logarithms                           Math.NumberTheory.Moduli                           Math.NumberTheory.MoebiusInversion@@ -71,6 +75,8 @@                           Math.NumberTheory.Primes.Testing.Certificates.Internal     extensions          : BangPatterns     ghc-options         : -O2 -Wall+    if flag(llvm)+        ghc-options     : -fllvm     ghc-prof-options    : -O2 -auto  source-repository head