The following module was proposed for inclusion in the Module List:
modid: Math::Prime::FastSieve
DSLIP: RdhOp
description: Fast prime number utils implemented in C++
userid: DAVIDO (David J. Oswald)
chapterid: 23 (Miscellaneous_Modules)
communities:
inline.perl.org mailing list, PerlMonks.org website.
similar:
Math::Prime::XS
rationale:
This module implements the Sieve of Eratosthenes in C++, and binds
it using Inline::CPP. The sieve is implemented as a bit vector, and
turns out to be very fast. It benchmarks significantly faster than
Math::Prime::XS. Also unlike Math::Prime::XS, it is capable of
extending the sieve all the way to over 2.14 billion.
Various tools that deal with primes are provided in the module.
It also serves as a proof of concept that Inline::MakeMaker can be
used to create a CPAN distribution based on the Inline and
Inline::CPP modules.
enteredby: DAVIDO (David J. Oswald)
enteredon: Thu Dec 15 05:59:43 2011 GMT
The resulting entry would be:
Math::Prime::
::FastSieve RdhOp Fast prime number utils implemented in C++ DAVIDO
Thanks for registering,
--
The PAUSE
PS: The following links are only valid for module list maintainers:
Registration form with editing capabilities:
https://pause.perl.org/pause/authenquery?ACTION=add_mod&USERID=42900000_a943ff86a789ea4f&SUBMIT_pause99_add_mod_preview=1
Immediate (one click) registration:
https://pause.perl.org/pause/authenquery?ACTION=add_mod&USERID=42900000_a943ff86a789ea4f&SUBMIT_pause99_add_mod_insertit=1
Peek at the current permissions:
https://pause.perl.org/pause/authenquery?pause99_peek_perms_by=me&pause99_peek_perms_query=Math%3A%3APrime%3A%3AFastSieve
