* Last bits for release 1.1.5.

[cln.git] / tests / timeMImisc5.cc

diff --git a/tests/timeMImisc5.cc b/tests/timeMImisc5.cc
index 36e81341a901d194c0155aee4e549236b73f330e..03a373e4dba84a857beb9fa59fad308e3db08bd6 100644 (file)
--- a/tests/timeMImisc5.cc
+++ b/tests/timeMImisc5.cc
@@ -1,10 +1,11 @@
-#include <cl_number.h>
-#include <cl_io.h>
-#include <cl_integer.h>
-#include <cl_modinteger.h>
+#include <cln/number.h>
+#include <cln/io.h>
+#include <cln/integer.h>
+#include <cln/modinteger.h>
 #include <stdlib.h>
 #include <string.h>
-#include <cl_timing.h>
+#include <cln/timing.h>
+using namespace cln;
 
 int main (int argc, char * argv[])
 {
@@ -16,21 +17,21 @@ int main (int argc, char * argv[])
        if (argc < 1)
                exit(1);
        cl_I p = "1269281897404513557783934075031171555202695168107";
-       cl_modint_ring R = cl_find_modint_ring(p);
+       cl_modint_ring R = find_modint_ring(p);
        {
                cl_MI a = R->canonhom("1111111111111111111111111111111111111111111111111");
                cl_MI b = R->canonhom("777777777777777777777777777777777777777777777777");
-               cl_stdout << "product modulo p" << endl;
+               cout << "product modulo p" << endl;
                { CL_TIMING;
                  for (int rep = repetitions; rep > 0; rep--)
                    { cl_MI c = R->mul(a,b); }
                }
-               cl_stdout << "square modulo p" << endl;
+               cout << "square modulo p" << endl;
                { CL_TIMING;
                  for (int rep = repetitions; rep > 0; rep--)
                    { cl_MI c = R->square(a); }
                }
-               cl_stdout << "quotient modulo p" << endl;
+               cout << "quotient modulo p" << endl;
                { CL_TIMING;
                  for (int rep = repetitions; rep > 0; rep--)
                    { cl_MI c = R->div(a,b); }
@@ -39,17 +40,17 @@ int main (int argc, char * argv[])
        {
                cl_MI a = R->canonhom("1234567890123456789012345678901234567890123456789");
                cl_MI b = R->canonhom("909090909090909090909090909090909090909090909090");
-               cl_stdout << "product modulo p" << endl;
+               cout << "product modulo p" << endl;
                { CL_TIMING;
                  for (int rep = repetitions; rep > 0; rep--)
                    { cl_MI c = R->mul(a,b); }
                }
-               cl_stdout << "square modulo p" << endl;
+               cout << "square modulo p" << endl;
                { CL_TIMING;
                  for (int rep = repetitions; rep > 0; rep--)
                    { cl_MI c = R->square(a); }
                }
-               cl_stdout << "quotient modulo p" << endl;
+               cout << "quotient modulo p" << endl;
                { CL_TIMING;
                  for (int rep = repetitions; rep > 0; rep--)
                    { cl_MI c = R->div(a,b); }