Navigation:
Browse pkgsrc
(this page)| 2024-11-16 13:08:07 by Thomas Klausner | Files touched by this commit (2504) |
Log message: *: recursive bump for perl 5.40 |
| 2023-07-06 11:43:03 by Thomas Klausner | Files touched by this commit (2483) |
Log message: *: recursive bump for perl 5.38 |
| 2022-06-28 13:38:00 by Thomas Klausner | Files touched by this commit (3952) |
Log message: *: recursive bump for perl 5.36 |
| 2021-10-26 12:56:13 by Nia Alarie | Files touched by this commit (458) |
Log message: math: Replace RMD160 checksums with BLAKE2s checksums All checksums have been double-checked against existing RMD160 and SHA512 hashes |
| 2021-10-07 16:28:36 by Nia Alarie | Files touched by this commit (458) |
Log message: math: Remove SHA1 hashes for distfiles |
| 2021-05-24 21:56:06 by Thomas Klausner | Files touched by this commit (3575) |
Log message: *: recursive bump for perl 5.34 |
| 2020-08-31 20:13:29 by Thomas Klausner | Files touched by this commit (3631) |
Log message: *: bump PKGREVISION for perl-5.32. |
| 2019-08-11 15:25:21 by Thomas Klausner | Files touched by this commit (3557) |
Log message: Bump PKGREVISIONs for perl 5.30.0 |
| 2019-06-30 22:17:50 by Nia Alarie | Files touched by this commit (1816) |
Log message: Update packages using a search.cpan.org HOMEPAGE to metacpan.org. The former now redirects to the latter. This covers the most simple cases where http://search.cpan.org/dist/name can be changed to https://metacpan.org/release/name. Reviewed by hand to hopefully make sure no unwanted changes sneak in. |
| 2019-01-12 13:50:10 by Wen Heping | Files touched by this commit (2) |
Log message:
Update to 0.73
Upstream changes:
0.73 2018-11-15
[ADDED]
- inverse_totient(n) the image of euler_phi(n)
[FIXES]
- Try to work around 32-bit platforms in semiprime approximations.
Cannot reproduce on any of my 32-bit test platforms.
- Fix RT 127605, memory use in for... iterators.
0.72 2018-11-08
[ADDED]
- nth_semiprime(n) the nth semiprime
- nth_semiprime_approx(n) fast approximate nth semiprime
- semiprime_count_approx(n) fast approximate semiprime count
- semi_primes as primes but for semiprimes
- forsetproduct {...} \@a,\@b,... Cartesian product of list refs
[FIXES]
- Some platforms are extremely slow for is_pillai. Speed up tests.
- Ensure random_factored_integer factor list is sorted min->max.
- forcomposites didn't check lastfor on every callback.
- Sun's compilers, in a valid interpretation of the code, generated
divide by zero code for pillai testing.
[FUNCTIONALITY AND PERFORMANCE]
- chebyshev_theta and chebyshev_psi redone and uses a table.
Large inputs are significantly faster.
- Convert some FP functions to use quadmath if possible. Without
quadmath there should be no change. With quadmath functions like
LogarithmicIntegral and LambertW will be slower but more accurate.
- semiprime_count for non-trivial inputs uses a segmented sieve and
precalculates primes for larger values so can run 2-3x faster.
- forsemiprimes uses a sieve so large ranges are much faster.
- ranged moebius more efficient for small intervals.
- Thanks to GRAY for his module Set::Product which has clean and
clever XS code, which I used to improve my code.
- forfactored uses multicall. Up to 2x faster.
- forperm, forcomb, forderange uses multicall. 2-3x faster.
- Frobenius-Khashin algorithm changed from 2013 version to 2016/2018.
|
New packages: