X-Git-Url: https://ginac.de/CLN/cln.git//cln.git?a=blobdiff_plain;f=src%2Fnumtheory%2Fcl_IF_millerrabin.cc;h=b720419ef8605dcae2cbd7d3d8b2d8a30584b3f0;hb=bcf970403e0a455f0dd2eeab49324acd9f2d9948;hp=a049ecaa5d6f46277600674aba29aa4867210d7a;hpb=dd9e0f894eec7e2a8cf85078330ddc0a6639090b;p=cln.git

diff --git a/src/numtheory/cl_IF_millerrabin.cc b/src/numtheory/cl_IF_millerrabin.cc
index a049eca..b720419 100644
--- a/src/numtheory/cl_IF_millerrabin.cc
+++ b/src/numtheory/cl_IF_millerrabin.cc
@@ -9,12 +9,14 @@
 
 // Implementation.
 
-#include "cl_modinteger.h"
+#include "cln/modinteger.h"
+
+namespace cln {
 
 cl_boolean cl_miller_rabin_test (const cl_I& n, int count, cl_I* factor)
 {
 	// [Cohen], section 8.2, algorithm 8.2.2.
-	var cl_modint_ring R = cl_find_modint_ring(n); // Z/nZ
+	var cl_modint_ring R = find_modint_ring(n); // Z/nZ
 	var cl_I m = n-1;
 	var uintL e = ord2(m);
 	m = m>>e;
@@ -61,3 +63,5 @@ cl_boolean cl_miller_rabin_test (const cl_I& n, int count, cl_I* factor)
 	}
 	return cl_true;
 }
+
+}  // namespace cln