comparison maths/Polyfit.h @ 268:9aedf5ea8c35

* remove exceptions from Polyfit, return bool instead of int from isModeMinor

 
  ///////////////////////////////////////////////////////////////////////////////
  // Modified by CLandone for VC6 Aug 2004
  ///////////////////////////////////////////////////////////////////////////////
 
+#include <iostream>
 
 using std::vector;
-
 
 class TPolyFit
 {
     typedef vector<vector<double> > Matrix;
 public:

     const int nterms(coefs.size());
     double correl_coef;
     zeroise(g, nterms);
     zeroise(a, nterms, nterms);
     zeroise(xmatr, npoints, nterms);
-    if(nterms < 1)
-	throw "PolyFit called with less than one term";
-    if(npoints < 2)
-	throw "PolyFit called with less than two points";
-    if(npoints != y.size())
-	throw "PolyFit called with x and y of unequal size";
+    if (nterms < 1) {
+        std::cerr << "ERROR: PolyFit called with less than one term" << std::endl;
+        return 0;
+    }
+    if(npoints < 2) {
+        std::cerr << "ERROR: PolyFit called with less than two points" << std::endl;
+        return 0;
+    }
+    if(npoints != y.size()) {
+        std::cerr << "ERROR: PolyFit called with x and y of unequal size" << std::endl;
+        return 0;
+    }
     for(i = 0; i < npoints; ++i)
     {
 	//      { setup x matrix }
 	xi = x[i];
 	xmatr[i][0] = 1.0;	   //     { first column }

 
     for(int k = 0; k < ncol; ++k)
     {
 	if(index [k][2] != 0)
 	{
-	    throw "Error in GaussJordan: matrix is singular";
+            std::cerr << "ERROR: Error in PolyFit::GaussJordan: matrix is singular" << std::endl;
+            return false;
 	}
     }
 
     for( int i = 0; i < ncol; ++i)
 	coef[i] = w[i][0];

 	{
 	    if(index[j][2] != 0)
 	    {
 		for(int k = 0; k < ncol; ++k)
 		{
-		    if(index[k][2] > 0)
-			throw "Error in GaussJordan2: matrix is singular";
+		    if(index[k][2] > 0) {
+                        std::cerr << "ERROR: Error in PolyFit::GaussJordan2: matrix is singular" << std::endl;
+                        return false;
+                    }
 
 		    if(index[k][2] < 0 && fabs(b[j][k]) > big)
 		    {
 			irow = j;
 			icol = k;