[libmath-prime-util-perl] branch master updated (775bb4d -> 5ee096f)
gregor herrmann
gregoa at debian.org
Sun Nov 5 17:36:12 UTC 2017
This is an automated email from the git hooks/post-receive script.
gregoa pushed a change to branch master
in repository libmath-prime-util-perl.
from 775bb4d releasing package libmath-prime-util-perl version 0.65-1
adds 72b071a Add random_semiprime
adds 4f1e187 random_semiprime: do first exp in native float
adds e93c1af Better random_semiprime for unrestricted 65+ bit
adds bec34c9 Latest ramanujan prime limits
adds a5fd945 Speedup for is_carmichael
adds 581ad67 Slight savings for Fermat base 2
adds a65ac49 Split out random_semiprime and random_unrestricted_semiprime
adds 4fc8396 overflow base changes, and Frobenius-Underwood test update
adds 952742d New Ei changed twin prime count results a bit
adds a0497f5 Hensel lifting in Montgomery inverse
adds a8713d3 Remove unused variable
adds 107fa58 Latest Ramanujan prime bound update.
adds 4bb433e New nth prime bounds and updated Ramanujan prime bounds
adds 066a77c Rewrite sieve marking
adds 8ad1c1d Updates to Ramanujan prime bounds
adds 40cd084 Update Ramanujan prime bounds and Mersenne test limit
adds 632abc8 Push func defines above all includes
adds 5dae0ac Change is_strong_pseudoprime for base=n case
adds 1141565 New sieve
adds 42ef627 Change is_strong_pseudoprime bahavior for PP
adds d542f2f Fix extra paren in big endian path
adds 2512999 Better and faster initial limits for count and nth bounds
adds a14d21b chinese objectifies bigint result
adds 5b9075f Consistent Lucas parameter selection. Add stronger Lucas test to primality.c.
adds 725a67d Move entropy_bytes, srand, csrand to XS
adds b243e27 Add forderange
adds f61741d Speedup for PP forderange
adds 78b50ac Add subfactorial example to doc
adds 15a4953 Update Mersenne exponent
adds 8090f47 Fallback entropy using timers
adds 1daa356 When calling PP csrand or srand, also call GMP seed
adds a61126c Add numtoperm, permtonum, randperm
adds 0230202 If urandomm64 input is within 32-bit, pass to urandomm32.
adds 9eb9faf Add shuffle
adds cd18ea7 Rewrite PP vecany, vecall, etc. as much simpler forms
adds 707c529 Spelling and coverage
adds 2584d16 git should ignore entropy .o file
adds 8af9d8e Bump version number
adds 524d8fb More detailed comment about algorithm
adds fb426ec Allow bigint rank when calling numtoperm
adds 3b085b0 Don't call GMP lucas sequence with old version
adds a272e1d compiler warnings
adds 4faee44 Work around old Perl and Math::BigInt::Lite
adds ca69c39 Doc change
adds 278a1bc Date in Changes file
adds b02f708 Add array prototype to shuffle
adds c2c006d Don't use XS objectify with 5.8 or earlier. Call PP directly.
adds eeccb42 Clean up todo
adds 52ebacb Increase const_int range
adds b064b44 Move Chacha static context up one level (to csprng)
adds c4834ce Move CSPRNG to per-thread context and remove locks
adds 6316ef6 Make sure we do a good seed on boot and every thread
adds 0647044 We auto-seed in XS, but not PP. Put back explicit seed on module load for PP.
adds d10fad8 Add correct argument for 32-bit use
adds 2e9d73f Compiler warnings
adds d552970 Doc updates for per-thread changes
adds e01012f Document secure configuration option
adds 1af8dbd Add is_square function
adds 8ebb9e8 Validate n in is_power, includes necessary string->bigint conversion
adds 515be25 lastfor in XS
adds 4979b79 Add lastfor to PP, tests for lastfor
adds 30b8ab3 Work around Perl internal error
adds 1461c61 Docs and simple formultiperm test
adds 02ce5fa Add another lastfor test
adds 643255b doc updates
adds cc009fc Add is_polygonal
adds 7d1e40d Bump version
adds e22af4c Compiler / XS warnings
adds 94f31a3 Date in Changes
adds 1ef2acb Add factorialmod
adds fe0c223 randperm with k << n faster and less memory.
adds 4044416 Comment change
adds 9e056d4 For prime partitions, pull min/max values into primes.
adds d77ed46 factorialmod can use by-primes method for faster results
adds 9549288 Faster factorialmod for composite m and big n
adds e77aa30 Tests for factorialmod
adds 19dc033 Optimize derangement code
adds 2b5e35b Use segmented sieve in factorialmod, 50% faster
adds d126f14 numtoperm stays in XS for large n
adds 14a7888 Add POPs command to remove dual return values for unknown bigint classes
adds 85eaa48 Speedup for string popcount
adds 8bd28e3 Allow Math::GMPq and Math::AnyNum as bigint classes
adds 6b5bf9d Factor speedups
adds 7b1fc6f Small improvement to addmod
adds db88d16 Use our own multi-base Montgomery Miller-Rabin
adds b06f754 Remove second perfect square pre-test on x86-64
adds f2a269d factorialmod with montmath used more often
adds 78266e1 Updated factoring code: add Lehman, update SQUFOF, update factor() recipe
adds aff8cf9 Remove rax constraint
adds 1988d48 Slightly faster HOLF, add HOLF and Lehman to factor loop.
adds 96d21fd Tests, spelling, exports, add lehman_factor, add factoring harness tests
adds ce7fa39 Updated mont_inverse
adds ce325aa Update factor recipe for faster speed on random inputs rather than semiprimes
adds 601db72 Split out 63-bit and 64-bit mulredc
adds 122a835 Update pbrent to use new mulredcs for better speed
adds 82bdd02 Add and use new loop start/stop functions from PP
adds 1e2ffc9 Fix formultiperm and lastfor
adds 241efb2 Don't force memory access for mulmod asm. Faster and smaller.
adds b5bde27 Add is_fundamental
adds 0683b0d Add Pari's ispowerful as an example
adds 5507776 forcomb {} n; iterates over all k 0 .. n. Power set of n. Matches Pari/GP and Perl6.
adds 1fffa95 Bump version number
adds ecbbd78 exp_mangoldt pure perl make sure r is not a bigint
adds 2da6df3 pminus1_factor and ecm_factor were mismatched after adding lehman_factor
adds 61fd18c Work around Perl 5.6.2 in stirling
adds 1b9bf3e Work around 5.6.2 brokenness
adds aeef289 Silence compiler warning
adds 185600a Bump Changes for release
adds 6f2a31d New upstream version 0.68
new 0c46fae Update upstream source from tag 'upstream/0.68'
new 1dfe741 Update debian/changelog
new 4e4f314 Declare compliance with Debian Policy 4.1.1.
new 98a6d89 Add a note about API changes from upstream Changes to debian/NEWS.
new 5ee096f releasing package libmath-prime-util-perl version 0.68-1
The 5 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.
Summary of changes:
Changes | 128 +++++-
MANIFEST | 4 +
META.json | 26 +-
META.yml | 22 +-
Makefile.PL | 19 +-
README | 2 +-
TODO | 44 +-
XS.xs | 743 +++++++++++++++++++++++--------
cache.c | 4 +-
chacha.c | 53 +--
chacha.h | 23 +-
csprng.c | 108 ++---
csprng.h | 22 +-
debian/NEWS | 12 +
debian/changelog | 8 +
debian/control | 2 +-
entropy.c | 87 ++++
entropy.h | 8 +
examples/inverse_totient.pl | 1 -
factor.c | 302 ++++++++++---
factor.h | 1 +
lib/Math/Prime/Util.pm | 355 ++++++++++++---
lib/Math/Prime/Util/ChaCha.pm | 4 +-
lib/Math/Prime/Util/ECAffinePoint.pm | 4 +-
lib/Math/Prime/Util/ECProjectivePoint.pm | 4 +-
lib/Math/Prime/Util/Entropy.pm | 4 +-
lib/Math/Prime/Util/ISAAC.pm | 4 +-
lib/Math/Prime/Util/MemFree.pm | 4 +-
lib/Math/Prime/Util/PP.pm | 417 +++++++++++++++--
lib/Math/Prime/Util/PPFE.pm | 114 ++++-
lib/Math/Prime/Util/PrimalityProving.pm | 4 +-
lib/Math/Prime/Util/PrimeArray.pm | 8 +-
lib/Math/Prime/Util/PrimeIterator.pm | 4 +-
lib/Math/Prime/Util/RandomPrimes.pm | 4 +-
lib/Math/Prime/Util/ZetaBigFloat.pm | 4 +-
lib/ntheory.pm | 15 +-
montmath.h | 188 +++-----
mulmod.h | 12 +-
primality.c | 153 +++++--
prime_nth_count.c | 62 ++-
prime_nth_count.h | 3 +
ptypes.h | 35 ++
ramanujan_primes.c | 124 +++---
random_prime.c | 82 +++-
random_prime.h | 11 +-
sieve.c | 415 ++++++++---------
sieve.h | 36 +-
t/02-can.t | 11 +-
t/16-randomprime.t | 25 +-
t/17-pseudoprime.t | 12 +-
t/25-lucas_sequences.t | 2 +-
t/26-combinatorial.t | 74 ++-
t/26-fundamental.t | 23 +
t/26-ispower.t | 13 +-
t/26-polygonal.t | 59 +++
t/31-threading.t | 6 +-
t/32-iterators.t | 83 +++-
t/80-pp.t | 2 +-
t/81-bignum.t | 7 +-
t/92-release-pod-coverage.t | 18 +-
t/93-release-spelling.t | 5 +-
util.c | 314 ++++++++++++-
util.h | 21 +-
63 files changed, 3257 insertions(+), 1107 deletions(-)
create mode 100644 entropy.c
create mode 100644 entropy.h
create mode 100644 t/26-fundamental.t
create mode 100644 t/26-polygonal.t
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git
More information about the Pkg-perl-cvs-commits
mailing list