X-Git-Url: https://ginac.de/CLN/cln.git//cln.git?a=blobdiff_plain;ds=sidebyside;f=src%2Finteger%2Fbitwise%2Fcl_I_mkf.cc;h=d62585dd7171f8dc46361afc5c0e5b525c9eab68;hb=665c18cd376d8d8c5a8eafb30681a3f9f46d4a99;hp=0e6b65c5be738fff44d03857bd788d3db132fac5;hpb=dd9e0f894eec7e2a8cf85078330ddc0a6639090b;p=cln.git

diff --git a/src/integer/bitwise/cl_I_mkf.cc b/src/integer/bitwise/cl_I_mkf.cc
index 0e6b65c..d62585d 100644
--- a/src/integer/bitwise/cl_I_mkf.cc
+++ b/src/integer/bitwise/cl_I_mkf.cc
@@ -4,15 +4,17 @@
 #include "cl_sysdep.h"
 
 // Specification.
-#include "cl_integer.h"
+#include "cln/integer.h"
 
 
 // Implementation.
 
-#include "cl_integer.h"
+#include "cln/integer.h"
 #include "cl_I.h"
 #include "cl_I_byte.h"
 
+namespace cln {
+
 const cl_I mask_field (const cl_I& n, const cl_byte& b)
 {
       // Methode:
@@ -23,11 +25,11 @@ const cl_I mask_field (const cl_I& n, const cl_byte& b)
       // Falls p <= l :
       //   q:=min(p+s,l).
       //   Extrahiere die Bits p,...,q-1 von n.
-      //   Falls p+s>l und n<0, füge p+s-l Einsenbits an (addiere 2^(p+s)-2^l).
-      var uintL s = b.size;
-      var uintL p = b.position;
-     {var uintL ps = p+s;
-      var uintL l = integer_length(n); // l = (integer-length n)
+      //   Falls p+s>l und n<0, füge p+s-l Einsenbits an (addiere 2^(p+s)-2^l).
+      var uintC s = b.size;
+      var uintC p = b.position;
+     {var uintC ps = p+s;
+      var uintC l = integer_length(n); // l = (integer-length n)
       if (l<=p)
         // l<=p
         if (!minusp(n))
@@ -47,3 +49,5 @@ const cl_I mask_field (const cl_I& n, const cl_byte& b)
             return erg;
      }  }
 }
+
+}  // namespace cln