Replace CL_REQUIRE/CL_PROVIDE(cl_I_ring) with portable code.

[cln.git] / include / cln / numtheory.h

diff --git a/include/cln/numtheory.h b/include/cln/numtheory.h
index f84360a7e0cfc3e2ab60fea3f37fe198ff95dab1..86b8324972cfefe969c3ed3ede3374b240830702 100644 (file)
--- a/include/cln/numtheory.h
+++ b/include/cln/numtheory.h
@@ -15,13 +15,13 @@ namespace cln {
 //                       ( --- )
 //                       (  b  )
 // a, b must be integers, b > 0, b odd. The result is 0 iff gcd(a,b) > 1.
-  extern int jacobi (sint32 a, sint32 b);
+  extern int jacobi (sintV a, sintV b);
   extern int jacobi (const cl_I& a, const cl_I& b);
 
 // isprobprime(n), n integer > 0,
 // returns true when n is probably prime.
 // This is pretty quick, but no caching is done.
-  extern cl_boolean isprobprime (const cl_I& n);
+  extern bool isprobprime (const cl_I& n);
 
 // nextprobprime(x) returns the smallest probable prime >= x.
   extern const cl_I nextprobprime (const cl_R& x);