More evaluation rules: abs(x^n) => abs(x)^n (x > 0, n is real).

[ginac.git] / check / exam_inifcns.cpp

diff --git a/check/exam_inifcns.cpp b/check/exam_inifcns.cpp
index 7d8cb978535aca9ce4cc7946e02077fdefbf37d9..994aa3444d6cf6e16ed2fd321897a433d3de4f17 100644 (file)
--- a/check/exam_inifcns.cpp
+++ b/check/exam_inifcns.cpp
@@ -4,7 +4,7 @@
  *  functions. */
 
 /*
- *  GiNaC Copyright (C) 1999-2008 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2011 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
@@ -21,15 +21,17 @@
  *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
-#include <iostream>
 #include "ginac.h"
-using namespace std;
 using namespace GiNaC;
 
+#include <iostream>
+using namespace std;
+
 /* Assorted tests on other transcendental functions. */
 static unsigned inifcns_consist_trans()
 {
        using GiNaC::asin; using GiNaC::acos;
+       using GiNaC::asinh; using GiNaC::acosh; using GiNaC::atanh;
 
        unsigned result = 0;
        symbol x("x");
@@ -123,6 +125,7 @@ static unsigned inifcns_consist_trans()
  * exists in closed form and check if it's ok. */
 static unsigned inifcns_consist_gamma()
 {
+       using GiNaC::tgamma;
        unsigned result = 0;
        ex e;
        
@@ -169,6 +172,7 @@ static unsigned inifcns_consist_gamma()
 static unsigned inifcns_consist_psi()
 {
        using GiNaC::log;
+       using GiNaC::tgamma;
 
        unsigned result = 0;
        symbol x;
@@ -215,11 +219,35 @@ static unsigned inifcns_consist_zeta()
        return result;
 }
 
+static unsigned inifcns_consist_abs()
+{
+       unsigned result = 0;
+       realsymbol a("a"), b("b"), x("x"), y("y");
+       possymbol p("p");
+
+       if (!abs(exp(x+I*y)).eval().is_equal(exp(x)))
+               ++result;
+
+       if (!abs(pow(p,a+I*b)).eval().is_equal(pow(p,a)))
+               ++result;
+
+       // also checks that abs(p)=p
+       if (!abs(pow(p,a+I*b)).eval().is_equal(pow(p,a)))
+               ++result;
+
+       if (!abs(pow(x+I*y,a)).eval().is_equal(pow(abs(x+I*y),a)))
+               ++result;
+
+       // it is not necessary a simplification if the following is really evaluated
+       if (!abs(pow(x+I*y,a+I*b)).eval().is_equal(abs(pow(x+I*y,a+I*b))))
+               ++result;
+
+}
+
 static unsigned inifcns_consist_various()
 {
        unsigned result = 0;
        symbol n;
-       ex e;
        
        if ( binomial(n, 0) != 1 ) {
                clog << "ERROR: binomial(n,0) != 1" << endl;            
@@ -239,6 +267,7 @@ unsigned exam_inifcns()
        result += inifcns_consist_gamma();  cout << '.' << flush;
        result += inifcns_consist_psi();  cout << '.' << flush;
        result += inifcns_consist_zeta();  cout << '.' << flush;
+       result += inifcns_consist_abs();  cout << '.' << flush;
        result += inifcns_consist_various();  cout << '.' << flush;
        
        return result;