X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Fexam_misc.cpp;h=1b07eb75df2d09c762ef1ec4df58940230dfff9f;hp=54d54414e8530dc64e3b99061a3bf64e3c23e6ef;hb=HEAD;hpb=63f3e977f92d51ea173382a9b7c4c3b18bda7b8e

diff --git a/check/exam_misc.cpp b/check/exam_misc.cpp
index 54d54414..31e0e9e2 100644
--- a/check/exam_misc.cpp
+++ b/check/exam_misc.cpp
@@ -3,7 +3,7 @@
  */
 
 /*
- *  GiNaC Copyright (C) 1999-2018 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2024 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
@@ -89,49 +89,6 @@ static unsigned exam_expand_power()
 	return result;
 }
 
-static unsigned exam_sqrfree()
-{
-	unsigned result = 0;
-	symbol x("x"), y("y");
-	ex e1, e2;
-	
-	e1 = (1+x)*pow((2+x),2)*pow((3+x),3)*pow((4+x),4);
-	e2 = sqrfree(expand(e1),lst{x});
-	if (e1 != e2) {
-		clog << "sqrfree(expand(" << e1 << ")) erroneously returned "
-		     << e2 << endl;
-		++result;
-	}
-	
-	e1 = (x+y)*pow((x+2*y),2)*pow((x+3*y),3)*pow((x+4*y),4);
-	e2 = sqrfree(expand(e1));
-	if (e1 != e2) {
-		clog << "sqrfree(expand(" << e1 << ")) erroneously returned "
-		     << e2 << endl;
-		++result;
-	}
-	e2 = sqrfree(expand(e1),lst{x});
-	if (e1 != e2) {
-		clog << "sqrfree(expand(" << e1 << "),[x]) erroneously returned "
-		     << e2 << endl;
-		++result;
-	}
-	e2 = sqrfree(expand(e1),lst{y});
-	if (e1 != e2) {
-		clog << "sqrfree(expand(" << e1 << "),[y]) erroneously returned "
-		     << e2 << endl;
-		++result;
-	}
-	e2 = sqrfree(expand(e1),lst{x,y});
-	if (e1 != e2) {
-		clog << "sqrfree(expand(" << e1 << "),[x,y]) erroneously returned "
-		     << e2 << endl;
-		++result;
-	}
-	
-	return result;
-}
-
 /* Arithmetic Operators should behave just as one expects from built-in types.
  * When somebody screws up the operators this routine will most probably fail
  * to compile.  Unfortunately we can only test the stuff that is allowed, not
@@ -235,6 +192,24 @@ static unsigned exam_subs()
 		++result;
 	}
 
+	// This used to fail in GiNaC 1.8.2 with subs_options::no_pattern
+	e1 = 1/x;
+	e2 = e1.subs(x == 1/x);
+	if (!e2.is_equal(x)) {
+		clog << "(1/x).subs(x==1/x) erroneously returned " << e2 << " instead of x" << endl;
+		++result;
+	}
+	e2 = e1.subs(x == 1/x, subs_options::no_pattern);
+	if (!e2.is_equal(x)) {
+		clog << "(1/x).subs(x==1/x, subs_options::no_pattern) erroneously returned " << e2 << " instead of x" << endl;
+		++result;
+	}
+	e2 = e1.subs(x == 1/x, subs_options::algebraic);
+	if (!e2.is_equal(x)) {
+		clog << "(1/x).subs(x==1/x, subs_options::algebraic) erroneously returned " << e2 << " instead of x" << endl;
+		++result;
+	}
+
 	return result;
 }
 
@@ -298,6 +273,29 @@ static unsigned exam_subs_algebraic()
 	return result;
 }
 
+/* Test suitable cases of the exponent power law: (e^t)^s=e^(ts). */
+static unsigned exam_exponent_power_law()
+{
+	unsigned result = 0;
+	symbol x("x");
+	realsymbol s("s");
+	possymbol t("t");
+
+	exmap pwr_exp =
+		{ {pow(exp(x), 2), exp(2*x)},
+		  {pow(exp(s), t), exp(s*t)},
+		  {exp(x)*pow(exp(x),-1), 1} };
+
+	for (auto e : pwr_exp) {
+		if (! (e.first.is_equal(e.second)) ) {
+			clog << "power of exponent  " << e.first << " produces error.\n";
+			++result;
+		}
+	}
+
+	return result;
+}
+
 unsigned exam_misc()
 {
 	unsigned result = 0;
@@ -307,11 +305,11 @@ unsigned exam_misc()
 	result += exam_expand_subs();  cout << '.' << flush;
 	result += exam_expand_subs2();  cout << '.' << flush;
 	result += exam_expand_power(); cout << '.' << flush;
-	result += exam_sqrfree(); cout << '.' << flush;
 	result += exam_operator_semantics(); cout << '.' << flush;
 	result += exam_subs(); cout << '.' << flush;
 	result += exam_joris(); cout << '.' << flush;
 	result += exam_subs_algebraic(); cout << '.' << flush;
+	result += exam_exponent_power_law(); cout << '.' << flush;
 	
 	return result;
 }