[libmath-prime-util-perl] 03/181: Measured mu+lpf methods, adjusted comments

[Partha P. Mukherjee]

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 89d9bc6cda98af3918172a8adc8a263d650be6e9
Author: Dana Jacobsen <dana at acm.org>
Date:   Tue Dec 10 19:29:13 2013 -0800

    Measured mu+lpf methods, adjusted comments
---
 lmo.c | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/lmo.c b/lmo.c
index 084a77f..30815c3 100644
--- a/lmo.c
+++ b/lmo.c
@@ -159,9 +159,10 @@ static uint32 prev_sieve_prime(uint32 n, uint8* sieve, uint32* segment_start, ui
 }
 
 /* Create factor table.
- * In lehmer.c we create mu and lpf arrays, which I suspect is faster.
- * Here we use Christian Bau's method, which is more memory efficient.
- * TODO: Neither the speed nor space really matter, but we should measure them.
+ * In lehmer.c we create mu and lpf arrays.  Here we use Christian Bau's
+ * method, which is slightly more memory efficient and also a bit faster than
+ * the code there (which does not use our fast ranged moebius).  It makes
+ * very little difference -- mainly using this table is more convenient.
  *
  * In a uint16 we have stored:
  *    0     moebius(n) = 0

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git