File: control

package info (click to toggle)
libmath-prime-util-perl 0.60-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 2,380 kB
  • ctags: 2,261
  • sloc: perl: 22,565; ansic: 8,478; python: 24; makefile: 12
file content (48 lines) | stat: -rw-r--r-- 2,318 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
Source: libmath-prime-util-perl
Maintainer: Debian Perl Group <pkg-perl-maintainers@lists.alioth.debian.org>
Uploaders: gregor herrmann <gregoa@debian.org>,
           Salvatore Bonaccorso <carnil@debian.org>
Section: perl
Testsuite: autopkgtest-pkg-perl
Priority: optional
Build-Depends: debhelper (>= 9.20120312~),
               help2man,
               libbytes-random-secure-perl,
               libmath-prime-util-gmp-perl (>= 0.41),
               libtest-warn-perl,
               perl
Standards-Version: 3.9.8
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-perl/packages/libmath-prime-util-perl.git
Vcs-Git: https://anonscm.debian.org/git/pkg-perl/packages/libmath-prime-util-perl
Homepage: https://metacpan.org/release/Math-Prime-Util

Package: libmath-prime-util-perl
Architecture: any
Depends: libbytes-random-secure-perl,
         libmath-prime-util-gmp-perl (>= 0.41),
         ${misc:Depends},
         ${perl:Depends},
         ${shlibs:Depends}
Recommends: libmath-bigint-gmp-perl,
            libmath-mpfr-perl,
            perl (>= 5.19.9) | libdigest-sha-perl (>= 5.87)
Description: 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.