This is an automated email from the git hooks/post-receive script.
ppm-guest pushed a change to annotated tag v0.14
in repository libmath-prime-util-perl.
at f510dac (tag)
tagging d6f41a62e5e9b902a305c9fe6e1431422d539893 (commit)
replaces v0.13
tagged by Dana Jacobsen
on Thu Nov 29 22:06:02 2012 -0800
- Log -----------------------------------------------------------------
CPAN version 0.14
Dana Jacobsen (23):
Add 'verbose' config option
Have verbose option set GMP verbosity also
Increased precision for bignum zeta and R
Update MR bases for deterministic tests
Use references in primes.pl for performance. Lucky primes take less
memory.
Move mulmod, powmod, etc. to separate file. A few changes.
Let AKS in XS work with larger inputs.
Split AKS out of isprime tests. Extend AKS from halfword to fullword.
Add jordan_totient, divisor_sum. Slight speedup for euler_phi and
moebius.
Streamline random prime test, add more testing for nbit and maurer random
primes
Streamline some expensive tests, move bignum Zeta/R to separate file
Changes file has test and zeta changes mentioned
Skip 15+ digit tests on broken 5.6.2. Workaround bug in Math::BigInt in
extra tests.
Fixup 5.6.2, and some li and Ei range cases
Tweak MR test, add environment variables to disable XS and GMP
Add PP Lehmer prime count, including nth_prime speedup. Fix some
no-XS-with-GMP issues.
Speed up PP Lehmer by 10-100x at the expense of memory
Fixes for various compile / test issues
Update for release, and standardize infinity processing
Modify tests to handle Win32 infinity also
Missed an inf
Fix 32-bit issue with lehmer
Work around broken 64-bit Perl 5.6.2
-----------------------------------------------------------------------
This annotated tag includes the following new commits:
new 7d7ae7a Initial commit
new db6e278 Implementation
new 173374e Add MemFree object for better memory control
new b918b92 Add factoring
new d9467f3 text cleanup
new b7d0e69 Add some items to do
new 1bfc4ea Updates for 32-bit behavior
new 504099f prime_count uses segmented sieve
new 40b1a2a Updates for next release
new c54cd40 Speed up factoring a smidgeon, prep for 0.03
new 39f6ea1 Make squfof recurse, and fix some issues with it
new f7deef1 Miller-Rabin and prob_prime
new 7e66d0d New tests and benchmarks
new 5c160e0 factoring benchmarks
new f761e56 Split out bitarray and type header files
new 7d6012c Redo factor loop
new 52935e2 Factoring is isprime updates
new a740090 More factoring changes
new 15e84bd pedantic cleanup
new 62a9793 Next prime overflow, HOLF factoring, compare with Pari
new 04af4ab Fix next_prime
new f9b9193 Factoring updates
new 0e4fe85 random primes, and no asserts
new 8ebc5ae Try another 64-bit detection method
new f4de011 Rename some test files
new 18c272d Changes for v0.04
new e0ab486 Tweak to mulmod use
new b7796c8 Add pseudoprime test for MR
new c882d45 Note need for more pseudoprime testing
new eafd373 Make asm x64 only
new 85685bc More pseudoprime testing
new 8f4796d Add perfect square discriminator
new f7169a1 Overflow for nth_prime, segment prime_count
new 92269f6 Add math functions
new cd97a86 Rewrite prime_count for segments
new 4afae2b Updates from testing, make nth_prime_approx more accurate
for large values
new 2c3cc18 Allow random_prime to use overridden rand
new c62ab6f Fix issue with sqrt rounding
new a17975b Small fixes
new be45b08 Many more tests
new e8a0765 Move from mallloc/free to New/Safefree
new 852bd58 Update for 0.06
new 5ceba17 Move Test::More to build vs. prereq; comment changes
new 3f327f7 Update for 0.07
new fd0d5e5 Initial scaffolding for threads
new fd61c4c Accuracy for math functions
new f900788 Remove simple sieve
new ed6a752 7/11/13 presieve added
new 1be2ec9 7/11/13 presieve added
new 4df9619 Add add_factors
new 4f1ca63 Add rational Chebyshev approx for Ei
new fc1e8c6 Thread safety
new 10fba38 improve threading
new e5857a6 Improve threading
new 78d5bed Add tests for all_factors
new f3fd04e Segments were in MB instead of KB. Waaaaay too much
memory
new 1bcf403 Add PrimeArray tied array
new 9334951 Fiddle with Makefile.PL
new b2e0c52 Add tests for primearray, move MemFree, prepare for 0.08
release
new 863fed3 Get ready for 0.08 release
new ef43b9b Start work on PP code
new cc71cd2 Pure Perl working on all tests
new 57028c6 Big speedups for pure perl code, though still too slow
new bfcdbea threading and PP changes
new 2e93053 Wasn't correctly selecting win32
new f1ac8f0 Documentation
new a2f9630 Add documentation
new 8c1a02c PP sieve benchmark, update tests, MR always returns 0 for
even input
new 2f3e8ce Update timings, fix test plan
new b728d6b Add some more implementations
new 3fedfb5 Add simple SoA (along with rant)
new 1362a6b Add some PP benchmarks
new 1670eb8 Style change for is_prime -- no performance difference
new 5c2f083 Speedup for PP is_prime and factor
new b4d8c78 Speedup for powmod/mulmod (helps factor, isprime, etc.)
new e6ac88e Cleanup random_prime a little
new cc7c8a4 Speed up random_ndigit_prime a little for 9+ digits
new 4c0490e Adjust comments
new bd31f9a Remove old renamed file
new eda96a0 Forgot prototype -- could be cause of test failure
new fc21970 Turn on bignum support for PP code
new d94fc11 Lots of bignum support
new 8e22367 Do a mod before power operations -- avoids fp exception
for very large bases on small n
new 3e23f1f Many changes for bignum support
new a940cb0 Test euler_phi for small values
new d33cde5 Note some bignum things that should be done
new 2188da0 Lots of bignum changes, new tests, update version number
new 50222df More bignum fun
new fff06a5 Benchmark both XS and front end
new 61e1c65 Add BPSW primality test, hooray
new 0c0f910 Miller Rabin returns 0 or 1 only. Export strong Lucas
pseudoprime function
new fb04008 Add missing test file to MANIFEST
new 3e3b780 Bigint enhancements
new 9271a62 Doc updates
new 8c46868 Full bigint support, add -bigint to import list to turn
off
new 5f0ed78 Merge conflicts?
new 2187c92 Restore Util.pm from $&^&$ up merge
new c1a3e12 Update for older Perls and bigint
new da62a64 Add tests for strong lucas pseudoprimes
new 695c937 3x speedup for bigint factor and primality
new a5842dc Redo random primes, add Maurer's algorithm.
random_ndigit_prime needs work.
new b72adcd Updates for portable bigints and random primes
new 40cb80d More random prime work
new c4219ab More random prime changes
new c05f032 Minor updates
new 23d03cd Tests for random primes, fix for random primes on 5.6.2
new d65f872 Recommend Math::BigInt::GMP and try to use in tests
new 330a0a1 more fun with bigints and random primes
new 3d981b4 Use the MPU:GMP module if we can
new 15cfc51 Fix an issue with random primes
new 084e79e Minor GMP related change for performance and doc
new d569ae0 GMP and bigint stuff
new 533650a fix POD issue
new 8347ffa Work on factoring a little
new 2d1025e Factoring speedups
new 4828d2f Change %lu to use unsigned long
new 097995b Use GMP primes function. Doc tweaks
new 60d5b63 Update TODO, add Math::Big to performance
new dfde14f Update performance number with Math::Primality estimate
new 9736a13 Merge branch 'master' of github.com:danaj/Math-Prime-Util
new e7ecf6f Strip out the prime_count and nth_prime bounds and approx
from C code
new b7a24d3 Minor updates for release
new b37e2ba Tweak native precision factoring sequence
new c48ac70 Tweaks, Dusart 2010 bounds, documentation overhaul
new 0fcc6dc Big documentation update for PP
new 1424210 Check main::rand() existance at runtime
new 5b2c0f6 Turn off threading tests for Cygwin
new f440ed1 Change exp2 to pow, and incorporate inverse into exponent
new 7b8aa40 Wrap inverse into exponent in Riemann Zeta evaluation
new ca6fc7b Bump version number
new 22003b3 Compile issues, especially MSC
new a6ece61 Add a prototype, remove an unused variable
new 77b5fcf rearrange math to keep precision in some cases
new 6915076 Change tests for next/prev 0..3572 to do 2 tests instead
of 7146. Speeds up a lot, and in theory should give us the same debug info
new 1d54e81 bigint / bignum changes
new 7677b7b Note the changes for today
new ed1a67a Add racing SQUFOF
new e885753 Racing SQUFOF & other UV factoring changes
new 0cb4b42 Turn off racing squfof in main routine
new 585537d Export RiemannZeta function
new bea44fd Update versions for next release
new 105da77 Call GMP prime_count if available
new 9c52e2d Add prime_set_config, add assume_rh, use Schoenfeld bounds
new e9d3a41 Remove done_testing()
new f32a6de Some changes for valgrind -- nothing big
new 78e0015 Add primorial and pn_primorial
new d8acf40 Use long doubles for possible better precision
new 45767df Fix issue with string input just a little larger than ~0
new a9e3611 Allow trial_primes to be more intelligent instead of
always forcing true trial division
new 158b8ba Better switch between segment and trial methods for very
large end values
new 0ba452d If using the GMP module for primes(), convert the result
to BigInts
new 303c044 Initial primes.pl implementation
new 480b5a2 Add primes.pl script
new b725603 Add Lucas, Fibonacci, and Palindromic primes, plus
speedups
new 48e0e70 Test harness for primes.pl script, comparing to OEIS data
new bbcbdb6 Fix up primorial and pn_primorial for bigints
new 1a3ce7e Major rewrite of primes.pl, and add more filters
new 3531db8 Small speedups
new 6c850f8 Next round of primes.pl mods
new 050e185 More primes.pl changes, and script test does multiple
filters
new af5cecc Recommend Math::BigInt::GMP -- it can speed things up a
LOT with big numbers
new a892e8f Enhancements to primes.pl tests
new 32c0cf3 Minor issues with huge inputs
new badbbc5 Add Lucky primes, make Cuban primes via a generator
instead of filter (hugely faster)
new b3e35fa Speed up powmod a tiny bit
new de88bbc Use 2 MR bases for more numbers
new 7b380c2 Rewrite p-1 factoring, enhance racing SQUFOF, switch to
racing SQUFOF in factor
new f11f5ef Simple primality proving added (the GMP code is much
better)
new 62f61f8 Add option to ensure all output has gone through
primality proving
new baf304f Fix compiler warnings
new d441297 Enable Travis CI
new 6f831a1 Changes for p-1 factoring
new a23c8b7 Add and enhance examples, add bin/factor.pl
new 7a63deb Add documentation for prime_set_config
new c4013aa Fix prime_count bug (added to test suite), add Lehmer
prime count
new 2b002b0 Use Lehmer method for big prime counts
new 3b88409 Comments and a small speedup for Lehmer
new a7bc5c6 More Lehmer improvements (faster, lower memory)
new 3d48233 More Lehmer speedups and memory enhancements
new eb3b3dd Don't run the 64-bit edge case on broken 5.6.2
new f8943f7 No timing messages from Lehmer, and reduce threshold
since it's faster now
new 3fe998d Relax constraint on bignum version. It works fine with
0.22
new e440b5d Add AKS primality test
new b88fdb7 Update some examples
new cbdd225 Skip the AKS tests on 32-bit machines. They're way too
slow in PP.
new 9e13087 Have nth_prime use Lehmer prime count on lower bound.
100x speedup for big numbers.
new 08dbf56 Update documentation
new b205114 Fix prime count issue and make standalone. Add Meissel
method.
new c1a2755 Ready for next release
new b9dde29 Add 'verbose' config option
new e9a1984 Have verbose option set GMP verbosity also
new d574abd Increased precision for bignum zeta and R
new 7f8f395 Update MR bases for deterministic tests
new e3521a5 Use references in primes.pl for performance. Lucky
primes take less memory.
new 73b3a6e Move mulmod, powmod, etc. to separate file. A few
changes.
new b1c0afc Let AKS in XS work with larger inputs.
new 29d4faa Split AKS out of isprime tests. Extend AKS from halfword
to fullword.
new 433250b Add jordan_totient, divisor_sum. Slight speedup for
euler_phi and moebius.
new 1f19230 Streamline random prime test, add more testing for nbit
and maurer random primes
new e0e6f21 Streamline some expensive tests, move bignum Zeta/R to
separate file
new d003539 Changes file has test and zeta changes mentioned
new 9b97f8a Skip 15+ digit tests on broken 5.6.2. Workaround bug in
Math::BigInt in extra tests.
new 0a75888 Fixup 5.6.2, and some li and Ei range cases
new 3e5a8b2 Tweak MR test, add environment variables to disable XS
and GMP
new a49ae24 Add PP Lehmer prime count, including nth_prime speedup.
Fix some no-XS-with-GMP issues.
new 2ffb217 Speed up PP Lehmer by 10-100x at the expense of memory
new 6695c65 Fixes for various compile / test issues
new d719bbe Update for release, and standardize infinity processing
new d0834cb Modify tests to handle Win32 infinity also
new 49b7d03 Missed an inf
new 44aef7d Fix 32-bit issue with lehmer
new d6f41a6 Work around broken 64-bit Perl 5.6.2
The 212 revisions listed above as "new" are entirely new to this
repository and will be described in separate emails. The revisions
listed as "adds" were already present in the repository and have only
been added to this reference.
--
Alioth's /usr/local/bin/git-commit-notice on
/srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git
_______________________________________________
Pkg-perl-cvs-commits mailing list
Pkg-perl-cvs-commits@lists.alioth.debian.org
http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-perl-cvs-commits
