Hello community,

here is the log from the commit of package ghc-math-functions for 
openSUSE:Factory checked in at 2018-12-06 12:16:28
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/ghc-math-functions (Old)
 and      /work/SRC/openSUSE:Factory/.ghc-math-functions.new.19453 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Package is "ghc-math-functions"

Thu Dec  6 12:16:28 2018 rev:3 rq:650506 version:0.3.1.0

Changes:
--------
--- /work/SRC/openSUSE:Factory/ghc-math-functions/ghc-math-functions.changes    
2018-10-25 08:17:47.972032496 +0200
+++ 
/work/SRC/openSUSE:Factory/.ghc-math-functions.new.19453/ghc-math-functions.changes
 2018-12-06 12:16:28.913573605 +0100
@@ -1,0 +2,10 @@
+Wed Nov 14 03:01:50 UTC 2018 - psim...@suse.com
+
+- Update math-functions to version 0.3.1.0.
+  ## Changes in 0.3.1.0
+
+    * Exported data types for iteration steps in root finding
+
+    * Defaults for root finding algorithm are documented
+
+-------------------------------------------------------------------

Old:
----
  math-functions-0.3.0.2.tar.gz

New:
----
  math-functions-0.3.1.0.tar.gz

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Other differences:
------------------
++++++ ghc-math-functions.spec ++++++
--- /var/tmp/diff_new_pack.LQBEjp/_old  2018-12-06 12:16:29.841572608 +0100
+++ /var/tmp/diff_new_pack.LQBEjp/_new  2018-12-06 12:16:29.845572604 +0100
@@ -19,7 +19,7 @@
 %global pkg_name math-functions
 %bcond_with tests
 Name:           ghc-%{pkg_name}
-Version:        0.3.0.2
+Version:        0.3.1.0
 Release:        0
 Summary:        Collection of tools for numeric computations
 License:        BSD-2-Clause

++++++ math-functions-0.3.0.2.tar.gz -> math-functions-0.3.1.0.tar.gz ++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/math-functions-0.3.0.2/Numeric/RootFinding.hs 
new/math-functions-0.3.1.0/Numeric/RootFinding.hs
--- old/math-functions-0.3.0.2/Numeric/RootFinding.hs   2018-09-02 
19:32:55.000000000 +0200
+++ new/math-functions-0.3.1.0/Numeric/RootFinding.hs   2018-11-13 
21:25:18.000000000 +0100
@@ -30,10 +30,12 @@
     , RiddersParam(..)
     , ridders
     , riddersIterations
+    , RiddersStep(..)
     -- * Newton-Raphson algorithm
     , NewtonParam(..)
     , newtonRaphson
     , newtonRaphsonIterations
+    , NewtonStep(..)
     -- * References
     -- $references
     ) where
@@ -172,9 +174,10 @@
 -- | Parameters for 'ridders' root finding
 data RiddersParam = RiddersParam
   { riddersMaxIter :: !Int
-    -- ^ Maximum number of iterations.
+    -- ^ Maximum number of iterations. Default = 100
   , riddersTol     :: !Tolerance
-    -- ^ Error tolerance for root approximation.
+    -- ^ Error tolerance for root approximation. Default is relative
+    --   error 4·ε, where ε is machine precision.
   }
   deriving (Eq, Read, Show, Typeable, Data
 #if __GLASGOW_HASKELL__ > 704
@@ -287,9 +290,10 @@
 -- | Parameters for 'ridders' root finding
 data NewtonParam = NewtonParam
   { newtonMaxIter :: !Int
-    -- ^ Maximum number of iterations.
+    -- ^ Maximum number of iterations. Default = 50
   , newtonTol     :: !Tolerance
-    -- ^ Error tolerance for root approximation.
+    -- ^ Error tolerance for root approximation. Default is relative
+    --   error 4·ε, where ε is machine precision
   }
   deriving (Eq, Read, Show, Typeable, Data
 #if __GLASGOW_HASKELL__ > 704
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/math-functions-0.3.0.2/changelog.md 
new/math-functions-0.3.1.0/changelog.md
--- old/math-functions-0.3.0.2/changelog.md     2018-09-02 19:32:55.000000000 
+0200
+++ new/math-functions-0.3.1.0/changelog.md     2018-11-13 21:25:18.000000000 
+0100
@@ -1,3 +1,10 @@
+## Changes in 0.3.1.0
+
+  * Exported data types for iteration steps in root finding
+
+  * Defaults for root finding algorithm are documented
+
+
 ## Changes in 0.3.0.2
 
   * Fix license field in cabal file
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/math-functions-0.3.0.2/math-functions.cabal 
new/math-functions-0.3.1.0/math-functions.cabal
--- old/math-functions-0.3.0.2/math-functions.cabal     2018-09-02 
19:32:55.000000000 +0200
+++ new/math-functions-0.3.1.0/math-functions.cabal     2018-11-13 
21:25:18.000000000 +0100
@@ -1,5 +1,5 @@
 name:           math-functions
-version:        0.3.0.2
+version:        0.3.1.0
 cabal-version:  >= 1.10
 license:        BSD2
 license-file:   LICENSE
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/math-functions-0.3.0.2/tests/view.hs 
new/math-functions-0.3.1.0/tests/view.hs
--- old/math-functions-0.3.0.2/tests/view.hs    2018-09-02 19:32:55.000000000 
+0200
+++ new/math-functions-0.3.1.0/tests/view.hs    1970-01-01 01:00:00.000000000 
+0100
@@ -1,102 +0,0 @@
-{-# LANGUAGE OverloadedStrings #-}
-import Control.Applicative
-import Control.Monad
-import Numeric.SpecFunctions
-import Numeric.MathFunctions.Constants
-import CPython.Sugar
-import CPython.MPMath
-import qualified CPython as Py
-
-import HEP.ROOT.Plot
-
-
-----------------------------------------------------------------
-
-
-viewBetaDelta = runPy $ do
-  addToPythonPath "."
-  m  <- loadMPMath
-  mpmSetDps m 100
-  xs <- forM pqBeta $ \(p,q) -> do x <- fromMPNum =<< mpmLog m =<< mpmBeta m 
(MPDouble p) (MPDouble q)
-                                   return (p,q, relErr x (logBeta p q))
-  draws $ do
-    -- let xs = [ (p,q, logBeta p q `relErr` (logGammaL p + logGammaL q - 
logGammaL (q+p)))
-    --          | (p,q) <- pqBeta
-    --          ]
-    add $ Graph2D xs
-
-
-pqBeta = [ (p,q)
-         | p <- logRange 50 0.3 0.6
-         , q <- logRange 50 5 6
-         ]
-  where
-
-
-
-
-viewIBeta x = runPy $ do
-  addToPythonPath "."
-  m <- loadMPMath
-  mpmSetDps m 30
-  --
-  let n  = 40
-  let pq =  (,)
-        <$> logRange n 100 1000
-        <*> logRange n 100 1000
-  --
-  xs <- forM pq $ \(p,q) -> do
-          i <- fromMPNum =<< mpmIncompleteBeta m (MPDouble p) (MPDouble q) 
(MPDouble x)
-          return (p,q, incompleteBeta p q x `relErr` i)
-  --
-  draws $ do
-    add $ Graph2D xs
-
-
-go = runPy $ do
-  addToPythonPath "."
-  m <- loadMPMath
-  mpmSetDps m 16
-  --
-  print =<< fromMPNum =<< mpmIncompleteBeta m (MPDouble 10) (MPDouble 10) 
(MPDouble 0.4)
-  print $ incompleteBeta 10 10 0.4
-
-
-
-
-viewLancrox = runPy $ do
-  addToPythonPath "."
-  m <- loadMPMath
-  mpmSetDps m 50
-  --
-  let xs = logRange 10000 (1e-8) (1e-1)
-  pl <- forM xs $ \x -> do y0 <- fromMPNum =<< mpmLog m =<< mpmGamma m 
(MPDouble x)
-                           return (x, y0)
-  draws $ do
-    add $ Graph $ [ (x, abs $ y `relErr` logGammaL x) | (x,y) <- pl ]
-    set $ lineColor RED
-    --
-    add $ Graph $ [ (x, abs $ y `relErr` logGamma x) | (x,y) <- pl ]
-    set $ lineColor BLUE
-    --
-    set $ xaxis $ logScale ON
-    -- set $ yaxis $ logScale ON
-    --
-    add $ HLine m_epsilon
-    add $ HLine $ negate m_epsilon
-
-
-----------------------------------------------------------------
-
-relErr :: Double -> Double -> Double
-relErr 0 0 = 0
-relErr x y = (x - y) / max (abs x) (abs y)
-
-
-
-logRange :: Int -> Double -> Double -> [Double]
-logRange n a b
-  = [ a * r^i | i <- [0 .. n] ]
-  where
-    r = (b / a) ** (1 / fromIntegral n)
-    
\ No newline at end of file


Reply via email to