#ifndef _CL_IF_H
#define _CL_IF_H
-#include "cl_number.h"
-#include "cl_integer.h"
+#include "cln/number.h"
+#include "cln/integer.h"
+
+namespace cln {
// Table of primes > 2, < 2^16
const uint32 cl_small_prime_table_limit = 65536;
// Returns true if n looks like a prime (with error probability < 4^-count).
// Returns false if n is definitely composite, and then sets factor = some
// nontrivial factor or 0.
-extern cl_boolean cl_miller_rabin_test (const cl_I& n, int count, cl_I* factor);
+extern bool cl_miller_rabin_test (const cl_I& n, int count, cl_I* factor);
+} // namespace cln
#endif /* _CL_IF_H */