* Also filter out SCCS subdirs while recursing and searching for

[cln.git] / src / float / transcendental / cl_LF_ratseries_qab.cc

diff --git a/src/float/transcendental/cl_LF_ratseries_qab.cc b/src/float/transcendental/cl_LF_ratseries_qab.cc
index e862ac526a3750def68454be91ee4311bc1f5650..5bdd6eb6a1ecbc94e5c0dfa56ca263b73ce92445 100644 (file)
--- a/src/float/transcendental/cl_LF_ratseries_qab.cc
+++ b/src/float/transcendental/cl_LF_ratseries_qab.cc
@@ -9,11 +9,13 @@
 
 // Implementation.
 
-#include "cl_lfloat.h"
-#include "cl_integer.h"
-#include "cl_abort.h"
+#include "cln/lfloat.h"
+#include "cln/integer.h"
+#include "cln/abort.h"
 #include "cl_LF.h"
 
+namespace cln {
+
 // Subroutine.
 // Evaluates S = sum(N1 <= n < N2, a(n)/b(n) * (p(N1)...p(n))/(q(N1)...q(n)))
 // and returns P = p(N1)...p(N2-1), Q = q(N1)...q(N2-1), B = B(N1)...B(N2-1)
@@ -90,3 +92,5 @@ const cl_LF eval_rational_series (uintL N, const cl_qab_series& args, uintC len)
 }
 // Bit complexity (if p(n), q(n), a(n), b(n) have length O(log(n))):
 // O(log(N)^2*M(N)).
+
+}  // namespace cln