Avoid "suggest explicit braces to avoid ambiguous 'else'" warnings.

[cln.git] / src / base / digitseq / cl_DS_mul_fftm.h

diff --git a/src/base/digitseq/cl_DS_mul_fftm.h b/src/base/digitseq/cl_DS_mul_fftm.h
index 9c9a5de2b52fa2941e233afa218606e904f16faf..a984802ce039e8179a26fda2681a2e133dba6fbd 100644 (file)
--- a/src/base/digitseq/cl_DS_mul_fftm.h
+++ b/src/base/digitseq/cl_DS_mul_fftm.h
@@ -11,7 +11,7 @@
 // multiplication, multiplication by the Nth root and unity and division
 // by N. Hence we can use the domain Z/(p^m Z) even if p is not a prime!
 
-// We use the Schönhage-Strassen choice of the modulus: p = 2^R+1. This
+// We use the Schönhage-Strassen choice of the modulus: p = 2^R+1. This
 // has two big advantages: Multiplication and division by 2 (which is a
 // (2R)th root of unity) or a power of 2 is just a shift and an subtraction.
 // And multiplication mod p is just a normal multiplication, followed by