log(-<realnumber>) now returns a real number

[ginac.git] / check / check_numeric.cpp

diff --git a/check/check_numeric.cpp b/check/check_numeric.cpp
index 74dcf33b27b7e7815a063ea37740b64fbc4deea0..bc3b24768311abf94c8284d208477f3dedfc562a 100644 (file)
--- a/check/check_numeric.cpp
+++ b/check/check_numeric.cpp
@@ -4,7 +4,7 @@
  *  tests on these numbers like is_integer() etc... */
 
 /*
- *  GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany
  *
  *  This program is free software; you can redistribute it and/or modify
  *  it under the terms of the GNU General Public License as published by
@@ -25,7 +25,7 @@
 
 /* Simple and maybe somewhat pointless consistency tests of assorted tests and
  * conversions. */
-static unsigned check_numeric1(void)
+static unsigned check_numeric1()
 {
        unsigned result = 0;
        bool errorflag = false;
@@ -53,7 +53,7 @@ static unsigned check_numeric1(void)
        return result;
 }
 
-static unsigned check_numeric2(void)
+static unsigned check_numeric2()
 {
        unsigned result = 0;
        bool errorflag = false;
@@ -66,20 +66,30 @@ static unsigned check_numeric2(void)
                        numeric nm(1,j);
                        nm += numeric(int(20.0*rand()/(RAND_MAX+1.0))-10);
                        // ...a numerator...
-                       do { i_num = rand(); } while (i_num == 0);
+                       do {
+                               i_num = rand();
+                       } while (i_num<=0);
                        numeric num(i_num);
                        // ...and a denominator.
-                       do { i_den = (rand())/100; } while (i_den == 0);
+                       do {
+                               i_den = (rand())/100;
+                       } while (i_den<=0);
                        numeric den(i_den);
                        // construct the radicals:
                        ex radical = pow(ex(num)/ex(den),ex(nm));
                        numeric floating = pow(num/den,nm);
                        // test the result:
                        if (is_a<numeric>(radical)) {
-                               clog << "(" << num << "/" << den << ")^(" << nm
-                                    << ") should have been a product, instead it's "
-                                    << radical << endl;
-                               errorflag = true;
+                               // This is very improbable with decent random numbers but it
+                               // still can happen, so we better check if it is correct:
+                               if (pow(radical,inverse(nm))==num/den) {
+                                       // Aha! We drew some lucky numbers. Nothing to see here...
+                               } else {
+                                       clog << "(" << num << "/" << den << ")^(" << nm
+                                                << ") should have been a product, instead it's "
+                                                << radical << endl;
+                                       errorflag = true;
+                               }
                        }
                        numeric ratio = abs(ex_to<numeric>(evalf(radical))/floating);
                        if (ratio>1.0001 && ratio<0.9999) {
@@ -95,7 +105,7 @@ static unsigned check_numeric2(void)
        return result;
 }
 
-unsigned check_numeric(void)
+unsigned check_numeric()
 {
        unsigned result = 0;