libmath-prime-util-perl 0.57-1 source package in Ubuntu
Changelog
libmath-prime-util-perl (0.57-1) unstable; urgency=medium * Import upstream version 0.57 * Update copyright years for upstream files * Update copyright years for debian/* packaging files -- Salvatore Bonaccorso <email address hidden> Mon, 04 Jan 2016 18:28:05 +0100
Upload details
- Uploaded by:
- Debian Perl Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Perl Group
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Xenial | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| libmath-prime-util-perl_0.57-1.dsc | 2.2 KiB | e5ac5d532d045e743ae5bbe31897662f5894f49ddd3bacb4a1318382470d6815 |
| libmath-prime-util-perl_0.57.orig.tar.gz | 489.5 KiB | aa07fd0cecd525bdb17da3bc0d2abcfad94370bcc7092000a85b33f8c1c152ee |
| libmath-prime-util-perl_0.57-1.debian.tar.xz | 5.0 KiB | 042b81186c770e39318fe224dcd4e153cabe05d4cd15c20fe73913d87d53e06e |
Available diffs
- diff from 0.56-1 to 0.57-1 (23.3 KiB)
- diff from 0.56-1build1 (in Ubuntu) to 0.57-1 (23.4 KiB)
No changes file available.
Binary packages built by this source
- libmath-prime-util-perl: utilities related to prime numbers, including fast sieves and factoring
Math::Prime::Util is a set of perl utilities related to prime
numbers. These include multiple sieving methods, is_prime,
prime_count, nth_prime, approximations and bounds for the prime_count
and nth prime, next_prime and prev_prime, factoring utilities, and
more.
.
The default sieving and factoring are intended to be (and currently are) the
fastest on CPAN, including Math::Prime::XS, Math::Prime::FastSieve,
Math::Factor::XS, Math::Prime::TiedArray, Math::Big::Factors,
Math::Factoring, and Math::Primality (when the GMP module is available). For
numbers in the 10-20 digit range, it is often orders of magnitude faster.
Typically it is faster than Math::Pari for 64-bit operations.
.
All operations support both Perl UV's (32-bit or 64-bit) and bignums. It
requires no external software for big number support, as there are Perl
implementations included that solely use Math::BigInt and Math::BigFloat.
However, performance will be improved for most big number functions by
installing Math::Prime::Util:: GMP, and is definitely recommended if you do
many bignum operations. Also look into Math::Pari as an alternative.
- libmath-prime-util-perl-dbgsym: debug symbols for package libmath-prime-util-perl
Math::Prime::Util is a set of perl utilities related to prime
numbers. These include multiple sieving methods, is_prime,
prime_count, nth_prime, approximations and bounds for the prime_count
and nth prime, next_prime and prev_prime, factoring utilities, and
more.
.
The default sieving and factoring are intended to be (and currently are) the
fastest on CPAN, including Math::Prime::XS, Math::Prime::FastSieve,
Math::Factor::XS, Math::Prime::TiedArray, Math::Big::Factors,
Math::Factoring, and Math::Primality (when the GMP module is available). For
numbers in the 10-20 digit range, it is often orders of magnitude faster.
Typically it is faster than Math::Pari for 64-bit operations.
.
All operations support both Perl UV's (32-bit or 64-bit) and bignums. It
requires no external software for big number support, as there are Perl
implementations included that solely use Math::BigInt and Math::BigFloat.
However, performance will be improved for most big number functions by
installing Math::Prime::Util:: GMP, and is definitely recommended if you do
many bignum operations. Also look into Math::Pari as an alternative.
