- Name: perl-Math-Prime-FastSieve
- Version: 0.190.0
- Release: 3.mga6
- Epoch:
- Group: Development/Perl
- License: GPL+ or Artistic
- Url: http://search.cpan.org/dist/Math-Prime-FastSieve
- Summary: Generate a list of all primes less than or equal
- Architecture: i586
- Size: 65391
- Distribution: Mageia
- Vendor: Mageia.Org
- Packager: pterjan <pterjan>
Description:
This module provides an optimized implementation of the Sieve of
Eratosthenes, and uses it to return a reference to an array all primes up
to any integer specified, within the limitations of addressable memory.
Additionally the module provides access to other Prime-related functions
that are facilitated as a by-product of having a really fast Prime Sieve.
At the time of writing, the 'primes' function will return all primes up to
and including '$n' faster than any other module I can find on CPAN
(including Math::Prime::XS). While a segmented sieve (which this isn't)
would extend the range of primes accessible, the fact that this module uses
a bit-sieve means that primes over a billion are easily within reach of
most modern systems.
- OptFlags: -O2 -g -pipe -Wformat -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -fstack-protector --param=ssp-buffer-size=4 -fomit-frame-pointer -march=i586 -mtune=generic -fasynchronous-unwind-tables
- Cookie: rabbit.mageia.org 1466306793
- Buildhost: rabbit.mageia.org
Sources packages:
Other version of this rpm:
