This is an automated email from the git hooks/post-receive script. ppm-guest pushed a commit to annotated tag v0.36 in repository libmath-prime-util-perl.
commit f25d223150775718d7839e16f9131cae76654248 Author: Dana Jacobsen <d...@acm.org> Date: Wed Dec 11 13:42:21 2013 -0800 Comment changes --- lmo.c | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-) diff --git a/lmo.c b/lmo.c index c1a803e..e7d6a82 100644 --- a/lmo.c +++ b/lmo.c @@ -25,9 +25,12 @@ * * Comparisons to the other prime counting implementations in this package: * + * Sieve: Segmented, single threaded, thread-safe. Small table enhanced, + * fastest for n < 60M. Bad growth rate (like all sieves will have). + * Legendre:Combinatorial phi. Simple implementation. * Meissel: Combinatorial phi. Simple implementation. * Lehmer: Combinatorial phi. Memory use grows rapidly. - * LMOS: Combinatorial phi. Very basic LMO implementation. + * LMOS: Combinatorial phi. Basic LMO implementation. * LMO: Sieve phi. 10-50x faster than LMOS, better growth rate, * Much, much better memory use than the others. * @@ -51,7 +54,7 @@ /* Below this size, just sieve (with table speedup). */ #define SIEVE_LIMIT 60000000 -/* Adjust to get best performance */ +/* Adjust to get best performance. Alpha from TOS paper. */ #define M_FACTOR(n) (UV) ((double)n * (log(n)/log(5.2)) * (log(log(n))-1.4)) /* Size of segment used for previous primes, must be >= 21 */ #define PREV_SIEVE_SIZE 512 -- Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git _______________________________________________ Pkg-perl-cvs-commits mailing list Pkg-perl-cvs-commits@lists.alioth.debian.org http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-perl-cvs-commits