tests/main.cc

   1 //#define WANT_OBFUSCATING_OPERATORS
   2 #include <cln/number.h>
   3 #include <cln/io.h>
   4 //#include <cln/complex.h>
   5 //#include <cln/real.h>
   6 //#include <cln/real_io.h>
   7 //#include <cln/output.h>
   8 //#include <cln/ffloat.h>
   9 #include <cln/integer.h>
  10 #include <cln/integer_io.h>
  11 //#include <cln/modinteger.h>
  12 //#include <cln/numtheory.h>
  13 #include <cln/timing.h>
  14
  15 #define DUMP(expr)  \
  16         fprint(cout, #expr" = "); fprint(cout, expr); fprint(cout, "\n");
  17
  18 int main (int argc, char* argv[])
  19 {
  20         (void)argc; (void)argv;
  21
  22 #if 0
  23         cl_F archimedes = pi((float_format_t)10000);
  24         fprint(cout, archimedes);
  25         fprint(cout, "\n");
  26 #endif
  27
  28 #if 0
  29         cl_FF a;
  30         cl_FF x1 = "-0.2173f0";
  31         cl_FF x2 = "5.5084f9";
  32         cl_FF y = "-1.19698f9";
  33         fprint(cout, "x1 = "); print_float_binary(cout,x1); fprint(cout, " = "); fprint(cout,x1); fprint(cout, "\n");
  34         fprint(cout, "x2 = "); print_float_binary(cout,x2); fprint(cout, " = "); fprint(cout,x2); fprint(cout, "\n");
  35         fprint(cout, "y = "); print_float_binary(cout,y); fprint(cout, " = "); fprint(cout,y); fprint(cout, "\n");
  36         cl_FF x = x1*x2;
  37         fprint(cout, "x1*x2 = "); print_float_binary(cout,x); fprint(cout, " = "); fprint(cout,x); fprint(cout, "\n");
  38 #endif
  39
  40 #if 0
  41         cl_I x = 10;
  42         cl_I y = ++x;
  43         x *= 2;
  44         x++;
  45         fprint(cout, "x = "); fprint(cout, x); fprint(cout, "\n");
  46         fprint(cout, "y = "); fprint(cout, y); fprint(cout, "\n");
  47 #endif
  48
  49 #if 0
  50         cl_I a = "77371252437321868671713407";
  51         cl_I w;
  52         cl_boolean squarep = isqrt(a,&w);
  53         DUMP(squarep);
  54         DUMP(w);
  55         DUMP(expt_pos(w,2) <= a);
  56         DUMP(a < expt_pos(w+1,2));
  57 #endif
  58
  59 #if 0
  60         cl_I m = "79228162513111556826425457664";
  61         cl_I a = "19787815858762768436681494528";
  62         cl_modint_ring R = find_modint_ring(m);
  63         cl_I b = R->retract(R->canonhom(a));
  64         cl_I c = mod(a,abs(m));
  65         DUMP(b);
  66         DUMP(c);
  67         DUMP(b==c);
  68 #endif
  69
  70 #if 0
  71         cl_N x = argv[1];
  72         cl_N y = sinh(x);
  73         { CL_TIMING; y = sinh(x); }
  74         cout << y << endl;
  75 #endif
  76
  77 #if 0
  78         cl_I x = argv[1];
  79         cout << x << " is " << (isprobprime(x) ? "" : "not ") << "prime" << endl;
  80 #endif
  81
  82 #if 0
  83         float_format_t f = float_format(atoi(argv[1]));
  84         extern cl_LF zeta3 (uintC len);
  85         uintC len = (uintC)f/intDsize+1;
  86         { CL_TIMING; cout << zeta(2,f) << endl; }
  87         { CL_TIMING; cout << expt(pi(f),2)/6 << endl; }
  88         { CL_TIMING; cout << zeta(3,f) << endl; }
  89         { CL_TIMING; cout << zeta3(len) << endl; }
  90         { CL_TIMING; cout << zeta(4,f) << endl; }
  91 #endif
  92
  93         cl_I a = cl_I(argv[1]);
  94         cl_I b = cl_I(argv[2]);
  95         cl_I u;
  96         cl_I v;
  97         cl_I g = xgcd(a,b,&u,&v);
  98         cout << "a = " << a << endl;
  99         cout << "b = " << b << endl;
 100         cout << "gcd = " << gcd(a,b) << endl;
 101         cout << "g = " << g << endl;
 102         cout << "u = " << u << endl;
 103         cout << "v = " << v << endl;
 104
 105 #if 0
 106         cl_F x = argv[1];
 107         cout << x << endl;
 108 #endif
 109
 110 }