[libmath-prime-util-gmp-perl] annotated tag upstream/0.40 created (now 61fccf4)

[Salvatore Bonaccorso]

This is an automated email from the git hooks/post-receive script.

carnil pushed a change to annotated tag upstream/0.40
in repository libmath-prime-util-gmp-perl.

        at  61fccf4   (tag)
   tagging  38b5f2c2205c4c8f4fb0ca717e7d46bfd25667d9 (commit)
  replaces  upstream/0.35
 tagged by  Salvatore Bonaccorso
        on  Fri Aug 5 14:28:12 2016 +0200

- Log -----------------------------------------------------------------
Upstream version 0.40

Andy Grundman (1):
      Add typedef for int32_t when using MSVC

Dana Jacobsen (65):
      Allow leading + signs in input
      double prime partial sieve; sieve deeper in prev_prime / next_prime
      double prime partial sieve; sieve deeper in prev_prime / next_prime
      Travis file update
      Sieve cluster test uses Math::BigInt with try.  Add test dependency.
      Make sqrtmod behave better with non-prime p
      Add: addmod,mulmod,divmod,powmod,sqrtmod
      make sure no zeros in random mods
      Try travis workaround
      powm with negative arg using not-new GMP library
      Don't use GMP backend in mod test -- we can't guarantee a new enough version
      Bernstein (2003) AKS algorithms, use T4.1 as default
      Update AKS code
      Add is_primitive_root
      Doc and test for is_primitive_root
      Add verbose output if we fail due to not trying hard enough
      More multipliers for native SQUFOF
      Faster primorial code
      Split lots of functions out of gmp_main; new files aks and primality
      Work around broken 5.6.2
      Add sieve_range
      Faster znprimroot
      Deeper sieving when generating primes plus primality test
      Edge cases for sieve_range
      Remove unused variables
      Update for release
      Add BLS theorems 17 (N+1) and 20 (combined N-1 / N+1).  Initial versions.
      custom primorial needs to stay inside UL max, not UV max.
      Primo v4 certs
      hybrid method has more theorems to use
      Add n+1 and bls75 combined proofs to API
      Allow sieving to 62-bit with 32-bit GMP
      Bump version
      Fix Kwalitee issues, bump version
      Change sprintf type for LP/LQ, add n+1 and hybrid BLS methods to standalone
      Better is_miller_prime use of logs.  is_prime spends less time proving.
      Rewrite most utilities, rewrite hybrid
      Merge pull request #6 from andygrundman/master
      Free input mpz_t before return
      Merge branch 'master' of github.com:danaj/Math-Prime-Util-GMP
      Fix memory leak in Ram tau
      Update Changes for release
      Add bernreal
      Add surround_primes and is_euler_plumb_pseudoprime
      Refactor Miller-Rabin.  Add restricted Perrin pseudoprimes.
      Add surround_primes
      Don't test Perrin pseudoprimes for small divisors at start.
      Update for release
      bernreal test and doc.  Fix export.  Fix precision.
      Fix some issues with is_nplus1_prime.  Still has issues.
      Error messages now use correct function names.  Also saves memory.
      surround primes with n <= 2
      Add simple LLR test
      Add tests for surround_primes
      Docs and tests for Euler-Plumb test
      Update old copyright date
      Update version
      Add sqrtint and rootint
      Add is_prime_power
      Slightly faster prob prime for tiny inputs
      Set behavior of is_primitive_root with n={0,1}
      Only do the 0/1 early return for n = 0 or +1
      Bump surround_primes to width of 20
      Change Perrin test to AS doubling from matrix power
      Cleanup for release

Salvatore Bonaccorso (1):
      Imported Upstream version 0.40

-----------------------------------------------------------------------

No new revisions were added by this update.

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-gmp-perl.git