summaryrefslogtreecommitdiffstats
path: root/games/primes
diff options
context:
space:
mode:
authorrgrimes <rgrimes@FreeBSD.org>1995-05-30 03:37:36 +0000
committerrgrimes <rgrimes@FreeBSD.org>1995-05-30 03:37:36 +0000
commit30ef9631c5eac7f8254bd3d7ad274d34d9f518b8 (patch)
tree4d8ac7e75ac179a918a76def244de6e3f3314e76 /games/primes
parent188803394908f222ab3ed8ec32331eb6dd00fd2d (diff)
downloadFreeBSD-src-30ef9631c5eac7f8254bd3d7ad274d34d9f518b8.zip
FreeBSD-src-30ef9631c5eac7f8254bd3d7ad274d34d9f518b8.tar.gz
Remove trailing whitespace.
Diffstat (limited to 'games/primes')
-rw-r--r--games/primes/pattern.c4
-rw-r--r--games/primes/pr_tbl.c2
-rw-r--r--games/primes/primes.c6
3 files changed, 6 insertions, 6 deletions
diff --git a/games/primes/pattern.c b/games/primes/pattern.c
index 5d65dab..14eb721 100644
--- a/games/primes/pattern.c
+++ b/games/primes/pattern.c
@@ -45,8 +45,8 @@ static char sccsid[] = "@(#)pattern.c 8.1 (Berkeley) 5/31/93";
*
* chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
*
- * To avoid excessive sieves for small factors, we use the table below to
- * setup our sieve blocks. Each element represents a odd number starting
+ * To avoid excessive sieves for small factors, we use the table below to
+ * setup our sieve blocks. Each element represents a odd number starting
* with 1. All non-zero elements are factors of 3, 5, 7, 11 and 13.
*/
diff --git a/games/primes/pr_tbl.c b/games/primes/pr_tbl.c
index b7b8d04..dcad3aa 100644
--- a/games/primes/pr_tbl.c
+++ b/games/primes/pr_tbl.c
@@ -45,7 +45,7 @@ static char sccsid[] = "@(#)pr_tbl.c 8.1 (Berkeley) 5/31/93";
*
* chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
*
- * We are able to sieve 2^32-1 because this table has primes up to 65537
+ * We are able to sieve 2^32-1 because this table has primes up to 65537
* and 65537^2 > 2^32-1.
*/
diff --git a/games/primes/primes.c b/games/primes/primes.c
index 706576b..a402be2 100644
--- a/games/primes/primes.c
+++ b/games/primes/primes.c
@@ -86,15 +86,15 @@ char table[TABSIZE]; /* Eratosthenes sieve of odd numbers */
/*
* prime[i] is the (i-1)th prime.
*
- * We are able to sieve 2^32-1 because this byte table yields all primes
+ * We are able to sieve 2^32-1 because this byte table yields all primes
* up to 65537 and 65537^2 > 2^32-1.
*/
extern ubig prime[];
extern ubig *pr_limit; /* largest prime in the prime array */
/*
- * To avoid excessive sieves for small factors, we use the table below to
- * setup our sieve blocks. Each element represents a odd number starting
+ * To avoid excessive sieves for small factors, we use the table below to
+ * setup our sieve blocks. Each element represents a odd number starting
* with 1. All non-zero elements are factors of 3, 5, 7, 11 and 13.
*/
extern char pattern[];
OpenPOWER on IntegriCloud