Whitespace checkin

1 files changed, 6 insertions, 6 deletions

diff --git a/nbtheory.cpp b/nbtheory.cpp
index bf1ea961..6e2d33a3 100644
--- a/nbtheory.cpp
+++ b/nbtheory.cpp
@@ -34,7 +34,7 @@ struct NewPrimeTable
 

 		primeTable.push_back(2);

 		unsigned int testEntriesEnd = 1;

-		

+

 		for (unsigned int p=3; p<=s_lastSmallPrime; p+=2)

 		{

 			unsigned int j;

@@ -175,7 +175,7 @@ bool IsLucasProbablePrime(const Integer &n)
 		++b; ++b;

 	}

 

-	if (j==0) 

+	if (j==0)

 		return false;

 	else

 		return Lucas(n+1, b, n)==2;

@@ -202,7 +202,7 @@ bool IsStrongLucasProbablePrime(const Integer &n)
 		++b; ++b;

 	}

 

-	if (j==0) 

+	if (j==0)

 		return false;

 

 	Integer n1 = n+1;

@@ -460,10 +460,10 @@ static bool ProvePrime(const Integer &p, const Integer &q)
 	const word16 * primeTable = GetPrimeTable(primeTableSize);

 

 	assert(primeTableSize >= 50);

-	for (int i=0; i<50; i++) 

+	for (int i=0; i<50; i++)

 	{

 		Integer b = a_exp_b_mod_c(primeTable[i], r, p);

-		if (b != 1) 

+		if (b != 1)

 			return a_exp_b_mod_c(b, q, p) == 1;

 	}

 	return false;

@@ -1076,7 +1076,7 @@ void PrimeAndGenerator::Generate(signed int delta, RandomNumberGenerator &rng, u
 		else

 		{

 			assert(delta == -1);

-			// find g such that g*g-4 is a quadratic non-residue, 

+			// find g such that g*g-4 is a quadratic non-residue,

 			// and such that g has order q

 			for (g=3; ; ++g)

 				if (Jacobi(g*g-4, p)==-1 && Lucas(q, g, p)==2)