| Name : perl-Math-Prime-Util
| |
| Version : 0.58
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : 1.1
| Date : 2016-06-24 07:28:06
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Math-Prime-Util-0.58-1.1.src.rpm
|
| Size : 1.04 MB
| |
| Packager : (none)
| |
| Summary : Utilities related to prime numbers, including fast sieves and factoring
|
Description :
A module for number theory in Perl. This includes prime sieving, primality
tests, primality proofs, integer factoring, counts / bounds /
approximations for primes, nth primes, and twin primes, random prime
generation, and much more.
This module is the fastest on CPAN for almost all operations it supports.
Only Math::Pari is faster for a few operations. This includes
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. If
you want high performance with big numbers (larger than Perl\'s native
32-bit or 64-bit size), you should install Math::Prime::Util::GMP and
Math::BigInt::GMP. This will be a recurring theme throughout this
documentation -- while all bignum operations are supported in pure Perl,
most methods will be much slower than the C+GMP alternative.
The module is thread-safe and allows concurrency between Perl threads while
still sharing a prime cache. It is not itself multi-threaded. See the
Limitations section if you are using Win32 and threads in your program.
Also note that Math::Pari is not thread-safe (and will crash as soon as it
is loaded in threads), so if you use Math::BigInt::Pari rather than
Math::BigInt::GMP or the default backend, things will go pear-shaped.
Two scripts are also included and installed by default:
* primes.pl displays primes between start and end values or expressions, with
many options for filtering (e.g. twin, safe, circular, good, lucky, etc.).
Use \'--help\' to see all the options.
* factor.pl operates similar to the GNU \'factor\' program. It supports bigint
and expression inputs.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl/openSUSE_13.1/x86_64 |
Hmm ... It's impossible ;-) This RPM doesn't exist on any FTP server
Provides :
Util.so()(64bit)
perl(Math::Prime::Util)
perl(Math::Prime::Util)
perl(Math::Prime::Util::ECAffinePoint)
perl(Math::Prime::Util::ECProjectivePoint)
perl(Math::Prime::Util::MemFree)
perl(Math::Prime::Util::PP)
perl(Math::Prime::Util::PPFE)
perl(Math::Prime::Util::PrimalityProving)
perl(Math::Prime::Util::PrimeArray)
perl(Math::Prime::Util::PrimeIterator)
perl(Math::Prime::Util::RandomPrimes)
perl(Math::Prime::Util::ZetaBigFloat)
perl(ntheory)
perl-Math-Prime-Util
perl-Math-Prime-Util(x86-64)
Requires :
