X-Git-Url: https://ginac.de/CLN/cln.git//cln.git?a=blobdiff_plain;ds=sidebyside;f=src%2Finteger%2Fbitwise%2Fcl_I_ldb.cc;h=41a699a2db20c9dbd404c6bef8a8510a1de5b70b;hb=8169a19b38c42588b39b21dae5bdb964e2f6b8c6;hp=81fecaf84b785e3fcf6bd9ee50300997aa91225a;hpb=c84c6db5d56829d69083c819688a973867694a2a;p=cln.git

diff --git a/src/integer/bitwise/cl_I_ldb.cc b/src/integer/bitwise/cl_I_ldb.cc
index 81fecaf..41a699a 100644
--- a/src/integer/bitwise/cl_I_ldb.cc
+++ b/src/integer/bitwise/cl_I_ldb.cc
@@ -1,7 +1,7 @@
 // ldb().
 
 // General includes.
-#include "cl_sysdep.h"
+#include "base/cl_sysdep.h"
 
 // Specification.
 #include "cln/integer.h"
@@ -10,8 +10,8 @@
 // Implementation.
 
 #include "cln/integer.h"
-#include "cl_I.h"
-#include "cl_I_byte.h"
+#include "integer/cl_I.h"
+#include "integer/bitwise/cl_I_byte.h"
 
 namespace cln {
 
@@ -25,7 +25,7 @@ const cl_I ldb (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^s-2^(l-p)).
+      //   Falls p+s>l und n<0, füge p+s-l Einsenbits an (addiere 2^s-2^(l-p)).
       var uintC s = b.size;
       var uintC p = b.position;
       var uintC l = integer_length(n); // l = (integer-length n)