X-Git-Url: https://ginac.de/ginac.git//ginac.git?a=blobdiff_plain;f=check%2Fcheck_lsolve.cpp;h=795f157d90126de925d9624ea922b813294b5405;hb=630e59f66af9fcebb56a442f3aef433b0cc1c0e0;hp=59264d9d1cb4cf23b173d438a72db6dca27529d5;hpb=bbe1866cef6b794266cd4917a54fb2c02a9931b4;p=ginac.git

diff --git a/check/check_lsolve.cpp b/check/check_lsolve.cpp
index 59264d9d..795f157d 100644
--- a/check/check_lsolve.cpp
+++ b/check/check_lsolve.cpp
@@ -1,10 +1,11 @@
 /** @file check_lsolve.cpp
  *
  *  These test routines do some simple checks on solving linear systems of
- *  symbolic equations. */
+ *  symbolic equations.  They are a well-tried resource for cross-checking
+ *  the underlying symbolic manipulations. */
 
 /*
- *  GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2009 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
@@ -18,16 +19,19 @@
  *
  *  You should have received a copy of the GNU General Public License
  *  along with this program; if not, write to the Free Software
- *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
-#include "checks.h"
+#include "ginac.h"
+using namespace GiNaC;
 
-#if defined(HAVE_SSTREAM)
-#  include <sstream>
-#else
-#  include <strstream>
-#endif
+#include <cstdlib> // for rand()
+#include <iostream>
+#include <sstream>
+using namespace std;
+
+extern const ex 
+dense_univariate_poly(const symbol & x, unsigned degree);
 
 static unsigned check_matrix_solve(unsigned m, unsigned n, unsigned p,
 								   unsigned degree)
@@ -55,15 +59,9 @@ static unsigned check_matrix_solve(unsigned m, unsigned n, unsigned p,
 	matrix X(n,p);
 	for (unsigned i=0; i<n; ++i) {
 		for (unsigned j=0; j<p; ++j) {
-#if defined(HAVE_SSTREAM)
 			ostringstream buf;
 			buf << "x" << i << j << ends;
 			x.push_back(symbol(buf.str()));
-#else
-			char buf[4];
-			ostrstream(buf,sizeof(buf)) << i << j << ends;
-			x.push_back(symbol(string("x")+buf));
-#endif
 			X.set(i,j,x[p*i+j]);
 		}
 	}
@@ -107,23 +105,16 @@ static unsigned check_inifcns_lsolve(unsigned n)
 {
 	unsigned result = 0;
 	
-	for (int repetition=0; repetition<100; ++repetition) {
+	for (int repetition=0; repetition<200; ++repetition) {
 		// create two size n vectors of symbols, one for the coefficients
 		// a[0],..,a[n], one for indeterminates x[0]..x[n]:
 		vector<symbol> a;
 		vector<symbol> x;
 		for (unsigned i=0; i<n; ++i) {
-#if defined(HAVE_SSTREAM)
 			ostringstream buf;
 			buf << i << ends;
 			a.push_back(symbol(string("a")+buf.str()));
 			x.push_back(symbol(string("x")+buf.str()));
-#else
-			char buf[3];
-			ostrstream(buf,sizeof(buf)) << i << ends;
-			a.push_back(symbol(string("a")+buf));
-			x.push_back(symbol(string("x")+buf));
-#endif
 		}
 		lst eqns;  // equation list
 		lst vars;  // variable list
@@ -173,31 +164,30 @@ static unsigned check_inifcns_lsolve(unsigned n)
 	return result;
 }
 
-unsigned check_lsolve(void)
+unsigned check_lsolve()
 {
 	unsigned result = 0;
 	
 	cout << "checking linear solve" << flush;
-	clog << "---------linear solve:" << endl;
 	
 	// solve some numeric linear systems
-	for (unsigned n=1; n<12; ++n)
+	for (unsigned n=1; n<14; ++n)
 		result += check_matrix_solve(n, n, 1, 0);
 	cout << '.' << flush;
 	// solve some underdetermined numeric systems
-	for (unsigned n=1; n<12; ++n)
+	for (unsigned n=1; n<14; ++n)
 		result += check_matrix_solve(n+1, n, 1, 0);
 	cout << '.' << flush;
 	// solve some overdetermined numeric systems
-	for (unsigned n=1; n<12; ++n)
+	for (unsigned n=1; n<14; ++n)
 		result += check_matrix_solve(n, n+1, 1, 0);
 	cout << '.' << flush;
 	// solve some multiple numeric systems
-	for (unsigned n=1; n<12; ++n)
+	for (unsigned n=1; n<14; ++n)
 		result += check_matrix_solve(n, n, n/3+1, 0);
 	cout << '.' << flush;
 	// solve some symbolic linear systems
-	for (unsigned n=1; n<7; ++n)
+	for (unsigned n=1; n<8; ++n)
 		result += check_matrix_solve(n, n, 1, 2);
 	cout << '.' << flush;
 	
@@ -208,12 +198,10 @@ unsigned check_lsolve(void)
 	result += check_inifcns_lsolve(5);  cout << '.' << flush;
 	result += check_inifcns_lsolve(6);  cout << '.' << flush;
 		
-	if (!result) {
-		cout << " passed " << endl;
-		clog << "(no output)" << endl;
-	} else {
-		cout << " failed " << endl;
-	}
-	
 	return result;
 }
+
+int main(int argc, char** argv)
+{
+	return check_lsolve();
+}