This is an automated email from the git hooks/post-receive script.
ppm-guest pushed a change to annotated tag v0.40
in repository libmath-prime-util-perl.
at af29509 (tag)
tagging b604e2c52e55a71aecdba4d545c6784fdfcca186 (commit)
replaces v0.39
tagged by Dana Jacobsen
on Mon Apr 21 22:34:34 2014 -0700
- Log -----------------------------------------------------------------
Version 0.40 on CPAN
Dana Jacobsen (43):
Bump version number
Update PP F-U primality test
Don't die in t/04 if platform doesn't have NaN (some activestate)
Speedup for exp_mangoldt
Documentation updates
Speedup exp_mangoldt for large numbers -- primality + power detection
instead of factoring
Shawe-Taylor random provable primes. No documentation.
Shawe-Taylor random proven primes from FIPS 186-4
Don't let ST random prime give up so easily
random ST primes streamline the 32-bit case, allow 2-bit to return 2
Update benchmark time
Add coverage areas
Add twin_prime_count
Add twin_prime_count_approx
give twin_prime_count a much denser table (92 vs. 5)
Expand twin prime table
Add nth_twin_prime
Merge branch 'master' of github.com:danaj/Math-Prime-Util
Add PP nth_twin_prime
AKS comments
Small nth_twin_prime speedup. xt test for twin_prime_count
Add xt nth_twin_prime test
Documentation tweaks
Add new functions to tests
Add PP twin_prime_count_approx
Concerns about each
Move a big hash to closure instead of sub local
Improve test coverage
Trim some PP tests for performance
Inverse Riemann R for nth_prime_approx
Add nth_twin_prime_approx, tighten twin_prime_count_approx
Finish nth_twin_prime_approx
Make sure nth_twin_prime goes to PP when the argument will overflow the C
code
Tighten nth_prime_{upper,lower}
Edge case for legendre_phi
speedups for legendre_phi with very large a
Add one more big-a optimization to legendre_phi
Add slightly faster ranged totient for start = 0
Fix an old random_prime() bigint case. No effect on proven, ndigit, or
nbit random primes.
More optimizations for euler_phi(0,n)
Version comparison, make no warnings with test versions
Don't do test for ST random prime without new Digest::SHA
Fix typos
-----------------------------------------------------------------------
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
new e04d2d3 Use Math::MPFR if possible for Ei/li/Zeta/R functions.
Huge speedup and accuracy gains for BigFloats.
new f5ca1e0 Tests for primorial, jordan_totient, divisor_sum
new 7943a7b Make random_*_prime do bignums when passed Math::BigInt
objects
new 855ad8c Random prime updates
new 315d5e2 Major changes to random primes. Return BigInts for big
results on primorial and random primes.
new 6e7e3bf Update tests for new functions, and Perl 5.6.2 workarounds
new 43b09d3 Revamp internal rand system for random primes
new a35c107 Swap system/user rand
new d588c12 Fix issue with Math::BigInt::GMP on 32-bit Win32
new 25b940c Fix some horrible breakage on 32-bit
new 5eef916 Better R accuracy with multiple calls
new 82af23f Remove an extra loop from PP M-R
new 7119f8e Work around randbits >= 32 on 32-bit system
new e48f2f9 Perl 5.8.2 gets 12345**4 wrong, change to
12345*12345*12345*12345
new 113f735 Don't use last bit of drand48
new 11c1903 MSC doesn't use inline. In theory __inline should work.
new 85b5552 Update timings for prime_count
new 0ead230 Make sure we don't try to use really old versions of MPFR
new e865e45 Very small optimization for PrimeArray.
new c5533dc Lighten threads testing for normal case (helps some
slower machines), add more for release testing
new 5711de7 Allow turning off MPFR. Run travis tests on dynamic
dependency variations.
new f0c0c5f Install mpfr before Math::MPFR
new 87f1585 Speed up Travis CI
new a6339fa Unroll inner loop of sieve for another 20% speedup
new a9df352 Allow primes.pl script to eval simple math expressions
new 028e761 Allow an expression to eval to 0
new be6502f Silence perl critic for expression eval
new e6b826c Revamp rand internals yet again. Sadly also a rand API
change.
new 4e13e5d Update rand function in test - Win32 32-bit needs mod
instead of and
new 3419e58 Update versions and dates for release
new 0f25dde Tweak rand setup a little
new 91a9d1c Don't run the long AKS test on any 32-bit platform
new 664f102 Fix old Solaris compilation
new 4ec5c58 Log some more bignum info to get a clue why old
ActiveState's BigInt::Calc barfs
new 8c4dfeb Round the perfect power test, note its faults
new a522f78 Add random_strong_prime, update to 0.18
new df6e091 Travis test with all features as well as deselections
new 26f73ce Update MR bases
new 8f56bbd Fix bignum / Calc issues (things turning into BigFloats)
new 6c21795 Add tests for is_provable_prime
new 2990405 Fix more bignum issues
new 5687cb8 Better test coverage
new 86ac1d8 More bignum and 5.6 changes
new 7f2819e Update MR bases
new 590d564 Update M-R bases
new a635e5e Modify validation to lower overhead
new b77b1d8 Prepare for 0.19 release
new cccb050 Speedup for PP AKS, turn off tests on 32-bit machines
new dc5a392 Change PP perfect square test
new e2794ed New perfect power implementation
new bdd3f15 Bump version for release
new e2461d9 Add function def to example
new 5f02d79 Add circular primes to primes.pl (OEIS 68652, also in
Project Euler problem 35)
new 40cdc70 Speedups for Pillai primes
new 11034f8 Minor tweaks
new 96d0f6d Spelling corrections in documentation
new ccc7965 Add Euler totient range, speedup divisor_sum
new 308abdc Switch to Bytes::Random::Secure
new 0862ac9 New M-R bases
new f400625 Range Moebius function. Fast Mertens function.
new 666d44f Ranged mobius function
new 079e8b1 Update documentation to reflect the change to
Bytes::Random::Secure
new 990011d Faster Mertens
new 5c70045 Add Mangoldt function
new 9285897 Performance enhancements
new f27df65 Testing changes for release
new 1adab04 Final changes for release
new 6cbd2cd Remove Algorithm::Diff dependency, as it isn't used any
more
new 49f6ec7 Totient and Mobius changes, move factor loop out of XS.xs
new 7c8fa21 Switch to pthreads condition variables
new b7bf6f6 Squash some compiler warnings
new 7228a75 Compiler warnings and coverage
new 11422a5 Put segment mutex back
new 4b9d3f3 move scripts
new 0fada75 Turn thread tests on for Cygwin and NetBSD. Add simple
RiemannZeta test cases
new c7d6fb0 Getting ready for release
new 3bf8b1e Optimizations for von Mangoldt function
new 590b1e1 Merge Akron's fix to dates in Changes
new 3caff7c Slight doc change for moebius/phi/lambda/M
new 4e81f05 Change XS Zeta code
new 1d1d03d Update PP Zeta -- much better now
new 9393ea9 Add consec int lcm, documentation changes
new ed4cf69 Fix return value with consec int lcm and MPU::GMP
new 0965fab Add binary search for nth_prime, for inputs > 2e11
new a48fe49 Minor updates
new 1e807e1 Add Chebyshev theta and psi functions
new 8aea368 10x speedup for divisor_sum
new 574e36e Test coverage and small AKS speedup
new 705c924 Start to add LMO prime_count
new 7be91a6 Change type of mobius return. Some different ranged
algorithms in comments
new 4af6895 Move totient range to util.c, speed it up a little bit
new fe9a34d Fix divisor sum on bigints
new 52b8d85 New data structure for phi(x,a): faster prime_count
new 0901cc7 In-place phi(x,a) merge
new b19757e Minor updates for release
new 4562fd0 Fix 32-bit issues
new 6390df3 Fix segmented euler_phi
new 972b3da Some more speedups
new 4b59f67 More lehmer tweaks
new b9cab41 Set smaller preseive with standalone primesieve
new adbc62b Improvements for PP prime_count
new 30e22b8 Minor updates for release
new 58cd150 Move a test into xt directory
new 1bbbfaf Add table sieve, fix off-by-one in Lehmer, change
sieve/advanced transition in Lehmer
new ec6de3b Merge branch 'master' of github.com:danaj/Math-Prime-Util
new 476d336 Newest M-R bases
new 49512f3 Change to unified method for small is_prime, next_prime,
prev_prime, prime_count
new 5226574 Add xt test to do exhaustive small is/next/prev tests
new 0b76b7f Update for release
new 21cd3c6 Documentation tweaks
new 49b8d46 Speed up p-1 stage 2
new 718c44d New internal macro to loop a..b using primary sieve
new bb1cc9e Forgot to skip one of the tests with broken 5.6.2
new 184a688 Update for primesieve 4.2
new 3e69d09 Documentation update, including a giant SEE ALSO section
new c72237b Tweak factoring and factor tests based on coverage
analysis
new ccb111f Documentation changes
new 4229dfe Speed up rsqufof a little, use for 19 dig semiprimes
new 5a80aeb Allow turning on/off gnufactor or pari
new 0f652e5 Travis-CI change in installation order
new e6db57b Add large bases to pseudoprime tests
new 6b2a185 Move the a=1 pbrent into XS.xs instead of factor.h
new 7150384 Move to next version number
new 0eef4fe Documentation updates
new e26a347 Fix: Was checking wrong BigInt variable and loading a
second backend.
new 1bd6c49 Primality verification (needs documentation)
new ec6c1ab Remove Data::Dump used for debugging
new 43a7cb9 Add tests for verify_prime
new 46166a2 Work on pure perl factoring
new 592e6c3 Add primality certificates, elliptic curve start
new 63a2961 Fix misspelled proof name
new b835662 PP: add simple ECM factoring and BLS75 primality proof
new c9ce369 Documentation formatting
new 1b374a4 Projective ECM for pure Perl
new aa43b9b Primality proof updates
new 3e6ff85 Add GMP-ECPP verification example
new 34da9f2 Tweak projective EC point
new a5e6994 Fixup for 5.6.2
new 72a23f4 Allow factor.pl to parse many MPU functions
new 1cc788d Move a couple of the bigger primality proofs to
RELEASE_TESTING -- slow without GMP
new 80cb008 Fixes for final release
new 5a33c7f Fix spelling error (RT 84782)
new 0540efd Speedups for pure perl factoring of small numbers
new f191905 Fix filename of ecpp verification, add sage version
new 6f543ae Fix error with big aks inputs (order would roll over)
new 8af5f6b Must compare n and q as bigints
new ef46084 primality certificate edge cases
new de8f5aa Convenient primality proof random test
new 9a05632 Merge branch 'master' of github.com:danaj/Math-Prime-Util
new 17559c6 Allow BLS75 theorem 7 n-1 proofs
new 62e3e90 pure perl factoring tweaks
new ef0c961 Merge branch 'master' of github.com:danaj/Math-Prime-Util
new 7cb7982 Small speedup for composites in is_prob_prime/is_prime
new 9015356 Increase coverage
new b7d411e Remove dead code
new e9b0ca7 Add spelling test and do some spelling adjustments
new cac18f0 Add more test coverage
new 376cab3 Let primes.pl accept +N as a second argument
new 1660bcb More test coverage
new 738a953 More verbose/error output consistency for verify_prime.
Tests.
new 35414dd Use XS initial validator
new 1478d34 Make is_prime go to is_prob_prime after initial tests
new 6675937 New 3-base solution
new b2b2191 Adjust tests to work around Perl 5.6.2 quirks
new 4bd921b Push full primality test into PP from Util.pm
new 3c13e38 Invert XS/Perl relation for is_prime, is_prob_prime,
next_prime, prev_prime
new c1bd445 Make sure test works on 32-bit platforms
new 8c499ee Rewrite PP Lucas code. About same speed, but simpler.
new 52430c9 Updates for release, including docuemntation and direct
C->MPU:GMP calls
new 2ea2f7a Minor updates for release
new 2f92c04 More efficient ranged Moebius code
new 5f42b95 Add forprimes multicall
new 76843d9 Backward compatibility changes around multicall
new c803cae Fix memory leak in forprimes. Document it.
new a217b6a Fix Win32 threading breakage
new ed60b06 Update primearray and add a simple iterator
new efa7895 Document the prime iterator
new b1a7215 tests for forprimes and iterator
new 67ba108 Update for release
new d10f7b3 Fix some multicall portability issues (5.8.2)
new 8dd3c25 Add new files to MANIFEST
new ae11792 ranged moebius was depending on char being signed. Fix.
Thanks Debian testers.
new ede3138 segmented sieve infrastructure, and have forprimes use it.
new 8d11397 Speed up primality proof tests on non-64-bit machines
new c50f380 Speed up primality proof tests on non-64-bit machines
new c7223a5 Add strong Lucas test
new 70ba979 Don't use MULTICALL yet -- memory leak
new 61ad7e5 Add two more probable prime tests
new f4e33b7 Add standard Lucas test
new 615c375 Transition some functions to forprimes
new 7b239a7 Fixes for 5.6 (sigh)
new eca9e7d Make sure non-XS can use forprimes properly
new 83472c0 Update some benchmarks and examples
new 7c4d65c Code comments about primality testing and the
non-exported F-U test
new c22623d Fix prime_count_approx being really slow for > 10^36
without Math::MPFR
new a8d928e Workaround for MSVC compiler
new d0ba63c Try to work around old Activestate crud
new aa85624 Add Lucas sequence and have all 3 Lucas tests use it
new c4c27ca Change to submod and mulsubmod for better portability
new b7e26bd Fix a refcount GMP callback issue, and add test for it
new 472e956 Remove unused variables, set reproducible random results
in a benchmark
new 6281c5a Add F-U compositeness test, and tighted ECPP certificate
conditions
new 3671c32 Use Data::Dump::dumpf
new 4ebadd5 Add lucas_sequence
new ea22a6b Add PP code and simple test for frobenius_underwood
probable prime test
new be92b20 Documentation updates
new 1fa0cbe Add braindead p+1 factoring
new ea68447 Speedup for P=1,Q=-1 Lucas sequence, which is half the
standard/Strong Lucas test cases
new 83b385f Make sure n is odd to get exact results from
lucas_sequence
new 69f6a75 Update Lucas tests
new 0c66a38 Almost extra strong lucas prps
new 371f900 Cleanup is_prob_prime
new d4c1bd6 Rewrite some performance comparison text
new 7ace5fb Turn on gcc's uint128 types if we have a new enough
version
new 6bf74f6 Update some benchmarks
new 68151cb Update todo list
new d584e6a Update p+1 factoring, add to tests
new 937450c Combine lots of functions with common signatures
new d0d1afa fixup AES Lucas test
new fcd36c1 typo fix
new 7e5b796 typo fixes
new 7b4558a Merge pull request #2 from dsteinbrunner/patch-1
new 8dffb63 Clean up Lucas, update PP is_prime, remove an test func
that got put in XS.xs, add documentation
new 77fe0d7 Changes file follows CPAN::Changes::Spec format
new 1a75d71 Not all gcc targets support uint128, e.g. Atom
new 829acaf Fix case of forprimes with begin = 6 returning 5, and add
test
new 3ca27cd signed chars fix for defined-out LMO function
new 3eded31 Tested multicall with 5.8, 5.10, 5.16, 5.17s, 5.18 --
looks good so just use it.
new 74fec80 Add cpanfile
new 88d4390 is_prime is faster now, so SophieGermain is over 2x faster
new 046c5a9 INCOMPLETE BROKEN : Switching to new text proofs, part 1
new 16b1986 Add primality proving submodule
new f282fde Switch to new text proofs, part 2
new 1aad573 Add standalone verifier (from MPU::GMP)
new 745317b Small grammar updates
new 4ba8d59 Add x86_64 asm for addmod from Kruppa
new b2f8022 Add more limitations on __int128 use
new a407ea9 Add proof documentation to TODO list
new 0bdb38c Update primality certificate documentation
new a7281dc 10-15% speedup for ranged totient internals
new 5d5534c Patch up silly MPU::GMP cert mistake
new 829338f Updates for random_nbit_prime and documentation
new 6a96229 Add random_proven_prime, modify random_nbit_prime
new 1ef154a Add carmichael_lambda; use F&T A2 for random_nbit_prime
new 7791b3c Turn off F&T A2, need to make sure top bit is set
new 66b60c1 Update for new M-R base from Panasiuk and Izykowski
new 67ce456 Remove code for F&T A2 -- needs fundamental change to
have nth bit set
new 5b245c9 Add BLS75 paper to references list
new a341eef Add a couple more CPAN mirrors, as the Travis-CI one has
lost data
new 11b8a1f Redo mirrors
new 23c1a98 Small updates for prime array
new 65ea92e Add output comments to primesarray bench
new 25809f6 Update a couple examples
new 0799f43 Speedup Maurer slightly by going straight to
is_prob_prime with GMP
new 19d92dd Use MPU::GMP::pn_primorial if possible
new cb1eb7a Add ifs to powmod initial mod; add verbose to factor.pl
new e1244e2 Merge branch 'master' of github.com:danaj/Math-Prime-Util
new c24f6f6 Allow parallel phi sum by using critical section around
phicache
new 040a785 Add Pk_2 function, simplify some code
new c2a0056 Add speedup for divisor count
new 2cb9452 Merge branch 'master' of github.com:danaj/Math-Prime-Util
new 83190bf Revised mulmod x86_64 asm, work with Wojciech Izykowski
new f64020b Merge branch 'master' of
https://github.com/danaj/Math-Prime-Util
new f246f75 Move primality functions to new file. Use Monty routines
new 9749d8c Primorial primes print a bit faster
new 2b32586 standardize variable names
new 3c14ce7 Add znorder function for multiplicative order
new ce2b9ec Fix sluggish validation of AES increment for common cases
new 7061ccd Add Monty math for Frob-Underwood, AES Lucas, and one
case for standard Lucas
new 9cd55d3 Divisor sum with integer second arg
new a7f63a0 Speedups for divisor_sum
new 8ce592a Montgomery reduction for all Lucas tests
new bb687ce Perl 5.6 fixes
new 67f3d32 Revamp input processing to accept bigints
new ae4f1d9 Cleanup
new 3508783 Tweak sieve to make more efficient for large bases
new 91d0a26 Add prime iterator object
new 14b421f Test for edge cases, fix some near-maxuv issues
new 1401eeb Use mpu method to get new oo iterator
new 7be347d Minor cleanup
new 041e0c8 ECPP verification: floor(2*sqrt(n)) instead of
2*floor(sqrt(n))
new 15de5bb Speedup for random_nbit_prime
new 914ef7b Make better comparisons for next/prev test
new 5b0992f Updates for release
new 9f816a8 Add stopword for newest spellchecker
new 468aacb Remove trailing whitespace
new 6100612 Speedup lucas sequence => speedup BPSW test
new 92831b6 Dynamically load BRS; PP random_nbit_prime speedup
new 9556c43 Merge branch 'master' of github.com:danaj/Math-Prime-Util
new 2b59342 Fix pure perl lucas sequence with Q=-1
new a2ab7c9 Redo benchmark section
new 67979c3 Add miller_rabin_random; add primality testing opinions
to documentation
new 99042b2 Make factor consistent in scalar context
new 86fae37 Merge branch 'master' of github.com:danaj/Math-Prime-Util
new 156c807 Cache random function for less overhead
new 8981c0a Make sure strtoull is used for 64-bit when possible
new 736a704 Adjust some benchmarks
new 9e68dad Merge branch 'master' of
https://github.com/danaj/Math-Prime-Util
new 5279b32 Remove all mirrors from travis config
new 09ca3d5 Simplify some of the randomness loop code
new fa70bdd Make Test::Warn a suggested dependency -- no longer
required
new 2d3483e Only use TEST_REQUIRES with new enough MM
new f737045 Merge branch 'master' of github.com:danaj/Math-Prime-Util
new 997ec07 delete TEST_REQUIRES after merging
new 291efcd Update Changes
new 4bb0db7 Example for abundant, deficient, perfect numbers
new fa31f4e Tiny PP factor speedup
new 722ec20 Iterator object tests and fixes for next/prev prime
behavior near native boundary
new 396279f Update iterator object value_to_i*
new 42d15b4 Documentation update
new 7e72cdd Updated LMO and Lehmer internals, switch to LMO
new fcbdc06 Silence compiler warnings on 32-bit
new 238db7e Little updates before release
new 3af56a3 fix some prime count performance and openmp cases
new ab0a869 Add XS routine for ([p1,p2,p3],[e1,e2,e3]) return from
factor
new 62d0d75 Lucas sequence should return a bigint if arg is a bigint
new de789fa Add liousville, factor_exp, partitions. all_factor
includes 1,n. Internally use factor_exp in many places.
new 0886915 Fix tests for all_factor, add liouville stopword
new 82894f0 Update partitions function
new 0684fca Document partitions, tweak implementation for a little
more speed
new 6190da4 Tests for partition()
new f8f9827 Add tests for liouville function
new c170460 Add tests for factor_exp and liouville
new 03ee354 Update version numbers
new 9a74bb0 Comment changes for part
new 519f12f Zeta updates
new e104357 Zeta accuracy test in xt/
new f4ffcaf Keep BigInt accuracy for Riemann Zeta/R
new ee69ab7 Speedups for pure perl testing
new 073d3a0 pondering pedantic perlcritic palaver
new 0ef064e exp_mangoldt in XS by default
new 7bca588 Improve test coverage
new b443c37 Fix PP is_pseudoprime; Fix test issues
new 126995b Use Lehmer for small prime counts (below 8000 million),
LMO for large
new ffec917 Tweaks to LMO performance
new 10d63d3 Hash->Scalar. Add peek() and __iter__()
new ec94f13 Update with some more iterator examples
new 337f556 Segment chebyshev_theta/phi, slight performance for
ranged totient
new 672bc12 Tiny efficiency for Mertens
new 0195347 Make sure large primorials don't overflow sigma_0
new 2f35ab9 Make sure we don't overflow large divisor counts on
32-bit machines
new e0cae15 Change C99 comments that snuck in
new 3117ccc Quote 0 in two tests, 5.8.2 use bigint treats 0 = NaN
new 9fd83d7 Make all tests run with 5.6.2 (with lots of skipping)
new ae32ca5 Remove unused feature requirement
new 7640a3e Revise prime count table code, speedup 3.6M to 6M
new 90fe804 update for release
new 6a35028 Update for release
new 3228494 Remove 64-bit test for 32-bit machines
new b1172a4 Update to next version number
new 5845699 Switch small primes and lpf arrays to uint32_t
new 6866e90 Wrap large constant in UVCONST
new 62f303b Add the extended prime count test
new c7908aa For 64-bit, primei must be a UV instead of uint32_t
new f3f8ce9 auto bigint, round 1
new 87fa96f Tests hit by Math::BigInt::GMP bug. Work around.
new be8f98d Next try at consistent type upgrades for
nth_prime_upper/lower
new 622fa8f Add commentary to measure_zeta_accuracy test
new 1cd370b Use XS prime count for small approx/lower/upper
new ab066b2 Changes for 32-bit
new e706275 32-bit fixes
new 69f65ed Extended LMO algorithm
new 6b63be2 Put icbrt in util.h
new 8056725 Move phi_total to sieve struct
new 200a6d5 Adjust M factor: save a little memory, gain a bit of
performance
new 8a308f6 Update version number
new 934f639 Just skip 64-bit testing on 5.6.2
new 7953a90 Remove two tests obsoleted by new BigInt behavior
new 7c25dcf Add nth prime extra test
new 6d0b318 Give the M adjustment a steeper slope
new dd2d4d7 Change nth_prime to use inverse Li+Corr instead of
inverse R
new 1ff0a21 Restructure step 7 phi summation to streamline inner loop
new 1b6c179 Protect against overflow
new 31afb1b Documentation updates
new 95e0280 Back off expensive PP prime count testing unless extended
testing
new b9c24be Thanks TravisCI -- need to count for the extra test when
skipping
new 4d95539 Final updates for release
new f5dc9dd Add some missing files to manifest
new bd7929c Microsoft VC isn't C99, sigh
new 8b96e19 fix LMO previous prime (sieve) when very near 32-bit limit
new 89d9bc6 Measured mu+lpf methods, adjusted comments
new 535d480 A fix for prime counts > 18446744056529682436
new f25d223 Comment changes
new 30e430d Ensure M=alpha*n3 doesn't underflow
new 478e828 Documentation change
new e0742a9 Add some 5.6.2 workarounds
new dc95551 Microsoft compiler workarounds
new 599f366 32-bit fixes, documentation updates
new 78db558 Speedup for Legendre Pi (use small phi)
new 3662953 LMO phi sieve is UV-word based instead of 32-bit-word
bases
new db3e43a Documentation updates; popcnt updates for LMO
new 53ae236 Remove trailing white space
new 40e5b5f Have 32-bit use parallel bit count instead of 8-bit table
new 8254d6d Documentation updates
new c6a1930 _divisor_list in XS, use it. Add simple forcomposites.
new 68a0877 first round of changes for factor(1)
new 9a56656 Second round of factor(0),factor(1) changes
new a5358ed typo in all_factors alias
new 6e901e6 Add fordivisors, forcomposites
new 8a0928d forcomposites using sieve
new eac8b27 Fix some compiler warnings
new 9cffea5 forcomposites UVMAX edge cases
new fa9264c Mapes => table for small phi
new c7e2b5a Revert back to SvREFCNT_inc for old Perls
new 9535910 Lehmer update cache settings
new 0d64350 New sieve code for finding segment composite inc/masks
new fd38afe Performance changes for prime sieve
new 0716c2d Fix spelling error (RT 91562)
new 0b97c03 Fix macro comparison, new benchmarks
new 426ffa6 Line too long in synopsis
new c6349fb Try to do fast word counts on 64-bit machines
new 034e128 Some performance tweaks
new 7125927 Remove dead code; convert count to segment start/next/end
new 11685f6 Convert segment_primes to segment start/next/end
new f3f5fc7 Speedup for basic sieve walking
new 8f2edbd Fixup for earlier sieve count change
new 620503e Switch to primesieve 5.0
new 7dd02e2 Add sign multiply to caching phi for a=0,1
new ea60ec1 Don't use GCC's builting popcount unless we have asm. It
can generate awful code.
new 18302e1 Small comment changes
new fe1f92c Use faster bit counting for sieve part of nth prime
new e3def2d Fix _XS_legendre_phi for new table phi
new 0b3812f Use presieve/test for large segment bases. Much faster
and less memory.
new 98d0e8e Wrap isqrt in #define so only included when needed
new c07ebde Switch znorder to factoring Carmichael Lambda
new 690a97f New factor_exp function
new 272b948 Add kronecker, totient, carmichael_lambda, znprimroot
new 0371266 Updated validate_int; znprimroot, carmichael_lambda,
kronecker
new 47af0e2 Add kronecker, znprimroot; XSify carmichael_lambda
new ba82ffc Move znorder to XS; add tests for znprimroot
new 08a2f59 Fix PP test issues
new 7033eec Huge speedup for znprimroot with non-cyclic input
new 94dd052 Allow string numbers to have a leading + sign
new a193d10 Make sure PP znprimroot handles non-cyclic nputs quickly
new 0150346 Speedups for Legendre/Meissel/Lehmer/LMOS old prime count
routines
new 47c1106 Add tests for kronecker
new 1392ff5 restore Win32 support
new f8e4968 Merge pull request #4 from bulk88/master
new d0f54d5 Merge branch 'master' of github.com:danaj/Math-Prime-Util
new 2696cc6 Add moebius/exp_mangoldt to util.c
new 0d7529a Shuffle functions between XS/Util/PP; significant XS
changes
new f3a9765 Cleanup compiler warnings
new bcff6a3 Change back to dTHX for now
new 913840e remove dTHX usage
new e1e4923 don't set global SP to itself after vcallsubn
new 8c60054 Hacky workaround to for MPU:GMP not understanding leading
plusses
new d7eee04 Remove redundancy in inner loop of
forprimes/forcomposites/fordivisors
new 361219e Merge pull request #5 from bulk88/master
new 053dfe0 Move divisor_sum to XS; more XS interface cleanup
new 4518c36 Wrap large constants in UVCONST for 64-bit Perl on 32-bit
machines
new 4e0e6ab various XSUB optimizations
new 9ed115d more XS tweaks
new 517233e More XS changes, plus small optimizations from bulk88
new 91f7c61 Workaround for 5.6.2 PP
new 150fa33 non-XSUB tweaks
new 25e1031 Merge XS changes from bulk88
new 9d022c9 Simplify my_svuv/my_sviv
new 51548ea Merge branch 'master' of
https://github.com/bulk88/Math-Prime-Util into bulk88-pr6
new 2fe6d93 Modifications to previous merge
new df94359 Stop checking return of New/Renew and its propagations
new 9d3bad1 Don't compile Legendre/Meissel/Lehmer/LMOS prime counts
by default
new 4a10314 Move factor_exp and divisors to XS->Perl, merge with
factor
new c1aa052 fix declaration after code and redefinition warning for
Win32
new bf712bd Merge pull request #7 from bulk88/master
new 3cc157e Merge euler_phi and moebius XS
new 0885daa More updates from bulk88 suggestions
new 4f56222 Next set of XS changes
new 0e33406 Input validation
new 50b9d5c XS tweaks from bulk88
new 3b96223 Fixes for 5.6.2
new 2d8120a Use constant
new 2f048d2 Input validation and better 5.6.2 support
new 7d90dd0 Fix threading argument
new 1de1b84 Work around RT 49569 (Math::BigInt::FastCalc)
new f4899e1 Add Kronecker tests
new 5efbc2e Add bigint tests for new functions
new ae9cc5e Add tests for legendre_phi
new 4edb0a1 PP legendre phi wasn't making enough primes via public API
new 8a8f04f nth_prime for legendre phi, not next_prime
new 114a02a Add test for t/81-bignum.t no-clobber
new a33b4a9 Update version number and date
new 0846451 Move prime_count, nth_prime to XS
new e12aceb More XS->Perl changes. Add constant SV* returns for
-1,0,1,2.
new 3645d32 Modify const SV for threads
new 068ad54 Another case of RT71548
new c0b5a3b Change sieve macro advance to not read ahead (valgrind)
new 128e95f Change comment to match current number of array items
new d3f0a05 Add gcd function. Fix forcomposites. Fix test for GMP
function definition.
new 7fd13a8 Refactor forprimes
new af8d7a0 Use memcpy doubling -- fewer calls needed
new 59238c0 Go back to 200M threshold vs. 2M for looking in cache
new 6b69260 use constant with hash. Saves a tiny bit of startup time
new 5be2033 Removed old SQUFOF code. Faster is_perfect_square.
Streamline trial division pre-factoring.
new 06eadfb Tweaks to SQUFOF, pbrent, and strategy
new f60d046 Speedup for palindromic primes
new 4f9aa60 Make is_bpsw_prime a first class function (though
currently not exported)
new 1692d44 is_perfect_square doesn't use isqrt
new ffd4fd9 mapes -> tablephi. Caching legendre phi
new 0c0f9d4 Speed up some testing. Move znorder to PP.pm
new 0f0531c XS tweaks
new 94c37ca Add lcm. Better PP legendre_phi. Prune PP documentation.
new 6b634d0 Try to use Pari in benchmark, but silently remove if not
available
new 2fea141 Performance tweaks (small) for bigints
new dbf2bd3 Performance updates for no-GMP, focusing on making test
suite run faster.
new 443caad Right number of extra tests, remove references to old
_XS_next_prime
new 9c98f1b First cut znlog
new 52d9da9 Merge pull request #8 from bulk88/master
new ad2592f Remove flags on get_cv
new 2ac307a Back off internal PP prime count in test, to help out
very slow machines
new 06d2159 Double speed of AKS for small numbers on slow-modulo
machines. poly_mod_mul checks for overflow in all terms are summed
new 68a3c9d Make sure we can use as an int
new c0c2eb9 Adjust use of constant to allow backward compatibility
new b2e7644 Merge branch 'master' of github.com:danaj/Math-Prime-Util
new 2b100bd Small aks speedup
new 2cc07a3 Move PP AKS to only run with EXTENDED_TESTING. It's
horribly slow, a function nobody should practically use for anything, and they
would run the C or GMP version anyway.
new 209e008 Reduce some variable scoping
new 6a81827 Trim PP testing
new 641c247 Use long double interface for the other three FP functions
new 5370db0 decl after code fix
new 91a51f7 When doing XS bigint downgrade on old Perl, set the string
new 9512fca Perl 5.6.2 workarounds for bigint downgrade
new 7406eed Performance for PP, and a few pre-5.8 64-bit workarounds
new 4670b90 More tests run on 5.6.2 64-bit now
new a0d9c79 Trim some tests, convert some proofs to new cert format,
more tests work with pre-5.8 64-bit
new 83600eb Turn off default irand in tests that don't care
new c62ac0d znlog tests and PP placeholder
new 209e98f Switch more funcs to long double, and return results as NV
new f5cc219 Add clz and ctz
new c54a128 More clz,ctz,log2floor changes
new c6a03f4 Use new clz/ctz/log2floor
new 2d499fa Fix arguments for non-public *_factor functions
new b3075fa Add ppport.h finally
new 73f085a Merge bulk88 XS changes. Add ppport.h use.
new 5167498 spacing
new 49d0199 small performance increase for next_prime
new 4d3882c Add simple (and likely buggy) Pollard Rho DLP
new e86068b Call Math::BigInt importer only if it hasn't been loaded
already
new e0d50c8 Changes for Math::BigInt::Pari (it doesn't play well with
others)
new 94aeed2 Remove the old -nobigint flag. Better random ndigit for
some old examples.
new 3f1b612 Honor rounds in Fermat
new d0fee2d Fix stupid cpp typo
new 7e26ad4 Push some constants into a shared header file
new c4ee137 Use constants.h. Simplify prev/next prime. Simplify
chebyshev functions. Results in smaller object files.
new 99ae304 ranged totient faster and uses less memory
new 5aaf977 Adjust PP testing to reflect some functions now being in
XS
new 821b7b6 Rearrange factor main loop
new 64fe821 remove _is_prime7, remove _XS_ header from a couple C
functions
new a1bd930 Minor changes to examples
new 441bbd9 Fix MSC support for ctz/clz, hopefully
new 19fb51c Simple Pari comparator (random values for functions in
Pari and MPU)
new 67f971f Pari's nth prime doesn't want 0
new b57e190 Move jordan_totient to XS->PP from Util
new 5b7938a znorder and znlog adjustments for edge cases
new 3e72965 Updated Pari compare test
new dff2ed6 LogarithmicIntegral using bignum and no-MPFR returns (1)
better results, (2) rounded to a sane number of digits
new 0447ce3 signed/unsigned warning
new d08d2fa Pari compare test done
new 4733aa9 Adjust comments
new d75a685 Adjust MANIFEST
new a13a939 Make sure logl(constants) are only done once
new ed35421 Simplify next_prime / prev_prime
new 3054619 BigInt was upgrading to float in some cases
new 569d1f8 Documentation updates
new 4bc4849 Merge branch 'master' of
https://github.com/danaj/Math-Prime-Util
new a17fe6b Adjust factor recipe, 3-5% faster for large inputs.
new 9e49408 Adjust primes sub to reflect new segment sieve behavior
new 14e86ff Simplify primes()
new 9728b39 Fix 32-bit unsigned long issues
new a17cb94 Load PP and Math::BigInt only when used. More work needed
new 987e1d8 No validation means we weren't stripping weirdness from
input bit counts. Use int("bits") to normalize.
new f2d43c3 Move some functions from Util.pm to util.c. Faster, and
reduces startup bloat.
new 0297d2a Start work on separate PP front end
new c3fa258 Put back some PP validation, as it does bigint magic
new 8a947e3 Bump version number
new b16de00 More movement to PP front end
new 0dbc616 More startup measurements
new f3e7800 More moving functions out of Util
new 60d376c Clean up some random / proven primes
new b61f82e Add some more terms to integer zeta table. Speeds up
prime_count_approx by 1.5x
new 4df059c Small RiemannR speedup
new 72fe357 Some TODO items are done
new 71a3bd1 znlog update
new bdbbdcf Remove the empty function call entirely for non-threads
new 1f31843 Update some examples
new 9a3fc47 Update examples and examples/README
new 71acd7e Add 1 to skipped 5.6.2 tests
new 45cade1 Move benchmarks to separate bench directory
new 9055b54 Adjust yafu tests
new c47d1ee Move last tests out of examples, into bench and xt
new 575a4ce Add Porter sequence example
new e29ece1 Update Changes
new c6adc48 Remove unused popcnt on 32-bit
new 344cff1 Minor documentation update
new 381a71f Add some Project Euler examples
new 11fe74b Merge branch 'master' of github.com:danaj/Math-Prime-Util
new e63256b First round: add is_perfect_power, is_perfect_square,
is_perfect_cube
new a011aa1 Add todo about perfect power. Going to change name.
new 6be7d4a Merge branch 'master' of github.com:danaj/Math-Prime-Util
new f174dde Change to is_power, still needs work
new 25dc64a is_power updates
new c02ce28 PP is_power with negative arguments
new 777992a Update some PE examples
new 31c2079 Trimming suggested by bulk88 (croak after New, move
memset to just the needed branch)
new 9d134eb Wrap dlp_prho debugging vomit inside #ifdef DEBUG, as
nobody else wants to see that detail
new 6600baf Code movement
new cc4ccdf Update PE 357 example
new ee46293 Fix 5.6.2 issue with is_power
new 382d4e2 euler_phi(0,n) had wrong [1] when n >= 100
new dd68fe4 Add inverse totient example
new 35f3847 PP is_power(n,a) has to deal with 0 return unlike the
split XS code
new d29c977 Better is_power
new fee1203 Merge with master
new 5c2ca94 Typo in bigint section
new e7fcbc3 More or less initial pbrent based on mulmod speed
new 6841339 Add two more PE examples
new fa0226e Add perfect power test in factoring
new 6661699 Small speedup for is_power(x,2)
new b38f21d Add a PE example
new 26aaca2 Only test for squares and cubes in factor. Lowers cost.
new 759e933 Add xt ispower test and some more PE examples
new 4133fac Slight speedup
new 141a8de Small totient speedup
new 301c9a0 Revised example of Math::Factor::XS::matches
new c8486c2 Add PE example
new 8a200c7 Remove unused line
new bc9f900 Remove old test and print comment
new 66ebfeb Spelling error: Dedekind
new b7c29e9 Small change to PP znprimroot
new 96ca911 Doc updates
new 6b52eda Update version number
new a3f4d07 Updates for AKS
new a330409 Small AKS update
new d7f425d Try harder to use lgamma
new db88ec8 Add some threshold returns to protect vs. messed up
rounding modes
new 3783549 Custom lgamma so improved AKS works on all platforms
new ce4360f ActiveState's gcc can't find builtins. Pre-2005 compiler?
new b779d4a Allow threading failures with diagnostics
new c575796 No MS intrinsics with MSC clang
new 8333e29 ispower test and 5.6.2 borkness
new 966eb2c Change NaN generation method
new 06930b0 Speedup for znprimroot
new 481ac3b Don't use Win32 intrins on WinCE
new d1b89ec fix sign warning in new znprimroot code
new ba4ac8a 32-bit with Math::BigInt::GMP causes havoc because of its
RT71548
new 21fc61f Allow some author tests to run better on 32-bit Perl
new 9230a69 Partitions uses Math::BigInt only when needed
new b098e7d logl -> log
new 0306484 Bump version
new ab1d4d1 Don't use Math::BigInt::Pari for threading tests.
Math::Pari + threads = bad juju
new edf7c2b PP jordan totient, be more aggressive about BigInt args.
ActiveState weirdness?
new c379974 Add float.h to includes
new 1b2723a Bump version number
new cf53b7d Update PP F-U primality test
new 3ac854a Don't die in t/04 if platform doesn't have NaN (some
activestate)
new 9dbf097 Speedup for exp_mangoldt
new f74438f Documentation updates
new dd6d999 Speedup exp_mangoldt for large numbers -- primality +
power detection instead of factoring
new 4eb186d Shawe-Taylor random provable primes. No documentation.
new 67508d1 Shawe-Taylor random proven primes from FIPS 186-4
new 2f3f0f8 Don't let ST random prime give up so easily
new d57550a random ST primes streamline the 32-bit case, allow 2-bit
to return 2
new 714c336 Update benchmark time
new db84c0c Add coverage areas
new f12cbbb Add twin_prime_count
new edc0a9e Add twin_prime_count_approx
new 3b566e5 give twin_prime_count a much denser table (92 vs. 5)
new 8bdf350 Expand twin prime table
new 9e1d2af Add nth_twin_prime
new b0ed22a Merge branch 'master' of github.com:danaj/Math-Prime-Util
new 16bebc8 Add PP nth_twin_prime
new c81f075 AKS comments
new 2caa6e5 Small nth_twin_prime speedup. xt test for
twin_prime_count
new 7cf90ba Add xt nth_twin_prime test
new ce3f38a Documentation tweaks
new 649d33e Add new functions to tests
new 61eb52f Add PP twin_prime_count_approx
new 2b7dae3 Concerns about each
new 175ee9b Move a big hash to closure instead of sub local
new 3b6009c Improve test coverage
new 1107ef2 Trim some PP tests for performance
new 51eb534 Inverse Riemann R for nth_prime_approx
new b7b1849 Add nth_twin_prime_approx, tighten twin_prime_count_approx
new d307891 Finish nth_twin_prime_approx
new 6b0ad3d Make sure nth_twin_prime goes to PP when the argument
will overflow the C code
new d35d25c Tighten nth_prime_{upper,lower}
new 242de60 Edge case for legendre_phi
new 9cfeab9 speedups for legendre_phi with very large a
new 6be3cee Add one more big-a optimization to legendre_phi
new 6e9b8a2 Add slightly faster ranged totient for start = 0
new f7325af Fix an old random_prime() bigint case. No effect on
proven, ndigit, or nbit random primes.
new 7f6602e More optimizations for euler_phi(0,n)
new ae3923b Version comparison, make no warnings with test versions
new 047642b Don't do test for ST random prime without new Digest::SHA
new b604e2c Fix typos
The 906 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
