libmath-prime-util-perl 0.55-1 source package in Ubuntu

Changelog

libmath-prime-util-perl (0.55-1) unstable; urgency=medium

  * Import upstream version 0.55

 -- Salvatore Bonaccorso <email address hidden>  Tue, 20 Oct 2015 07:09:16 +0200

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 Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
libmath-prime-util-perl_0.55-1.dsc 2.2 KiB 9510a799e23ab6c3c4454a7dcb1340f2be84a7053c44254fa3badda421f85c4e
libmath-prime-util-perl_0.55.orig.tar.gz 479.9 KiB 5ebf7f53818007e22c4d881d87381736e97631cc16b3d8ea20c2a4798e3b5fb3
libmath-prime-util-perl_0.55-1.debian.tar.xz 4.9 KiB 71815476aa99808cc580c785fa166cc318f9fc9e377b01bf927ddcbccf3da7c8

Available diffs

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.