\r
namespace cln {\r
\r
-static const cl_I digits_to_I_base2 (const char * MSBptr, uintL len, uintD base)\r
+static const cl_I digits_to_I_base2 (const char * MSBptr, uintC len, uintD base)\r
{\r
// base is a power of two: write the digits from least significant\r
// to most significant into the result NUDS. Result needs\r
return NUDS_to_I(erg_MSDptr,erg_len);\r
}\r
\r
-static const cl_I digits_to_I_baseN (const char * MSBptr, uintL len, uintD base)\r
+static const cl_I digits_to_I_baseN (const char * MSBptr, uintC len, uintD base)\r
{\r
// base is not a power of two: Add digits one by one. Result nees\r
// 1+ceiling(len*log(base)/(intDsize*log(2))) or some more digits.\r
var uintD* erg_MSDptr;\r
var uintC erg_len;\r
var uintD* erg_LSDptr;\r
- var uintL need = 1+floor(len,intDsize*256); // > len/(intDsize*256) >=0\r
+ var uintC need = 1+floor(len,intDsize*256); // > len/(intDsize*256) >=0\r
switch (base) { // multiply need with ceiling(256*log(base)/log(2)):\r
case 2: need = 256*need; break;\r
case 3: need = 406*need; break;\r
return NUDS_to_I(erg_MSDptr,erg_len);\r
}\r
\r
-const cl_I digits_to_I (const char * MSBptr, uintL len, uintD base)\r
+const cl_I digits_to_I (const char * MSBptr, uintC len, uintD base)\r
{\r
if ((base & (base-1)) == 0) {\r
return digits_to_I_base2(MSBptr, len, base);\r