Changeset 1784 for trunk/psLib/src/math/psPolynomial.c

Timestamp:

Sep 10, 2004, 1:20:41 PM (22 years ago)

Author:

gusciora

Message:

...

File:

• trunk/psLib/src/math/psPolynomial.c (modified) (14 diffs)

trunk/psLib/src/math/psPolynomial.c

@@ -7 +7 @@
  *  polynomials.  It also contains a Gaussian functions.
  *
- *  @version $Revision: 1.34 $ $Name: not supported by cvs2svn $
- *  @date $Date: 2004-09-10 22:25:59 $
+ *  @version $Revision: 1.35 $ $Name: not supported by cvs2svn $
+ *  @date $Date: 2004-09-10 23:20:29 $
  *
  *  Copyright 2004 Maui High Performance Computing Center, University of Hawaii
@@ -560 +560 @@
     int loop_x = 0;
     int loop_y = 0;
+    int i = 0;
     float polySum = 0.0;
     psPolynomial1D* *chebPolys = NULL;
@@ -581 +582 @@
         }
     }
-
+    for (i=0;i<maxChebyPoly;i++) {
+        psFree(chebPolys[i]);
+    }
     psFree(chebPolys);
     return(polySum);
@@ -667 +670 @@
     int loop_y = 0;
     int loop_z = 0;
+    int i = 0;
     float polySum = 0.0;
     psPolynomial1D* *chebPolys = NULL;
@@ -695 +699 @@
     }
 
+    for (i=0;i<maxChebyPoly;i++) {
+        psFree(chebPolys[i]);
+    }
     psFree(chebPolys);
     return(polySum);
@@ -799 +806 @@
     int loop_y = 0;
     int loop_z = 0;
+    int i = 0;
     float polySum = 0.0;
     psPolynomial1D* *chebPolys = NULL;
@@ -833 +841 @@
     }
 
+    for (i=0;i<maxChebyPoly;i++) {
+        psFree(chebPolys[i]);
+    }
     psFree(chebPolys);
     return(polySum);
@@ -1235 +1246 @@
     int loop_x = 0;
     int loop_y = 0;
+    int i = 0;
     double polySum = 0.0;
     psPolynomial1D* *chebPolys = NULL;
@@ -1257 +1269 @@
     }
 
+    for (i=0;i<maxChebyPoly;i++) {
+        psFree(chebPolys[i]);
+    }
     psFree(chebPolys);
     return(polySum);
@@ -1341 +1356 @@
     int loop_y = 0;
     int loop_z = 0;
+    int i = 0;
     double polySum = 0.0;
     psPolynomial1D* *chebPolys = NULL;
@@ -1369 +1385 @@
     }
 
+    for (i=0;i<maxChebyPoly;i++) {
+        psFree(chebPolys[i]);
+    }
     psFree(chebPolys);
     return(polySum);
@@ -1475 +1494 @@
     int loop_y = 0;
     int loop_z = 0;
+    int i = 0;
     double polySum = 0.0;
     psPolynomial1D* *chebPolys = NULL;
@@ -1509 +1529 @@
     }
 
+    for (i=0;i<maxChebyPoly;i++) {
+        psFree(chebPolys[i]);
+    }
     psFree(chebPolys);
     return(polySum);
@@ -1750 +1773 @@
 
 
+
+/*****************************************************************************
+psSpline1DGen(): This routine will take an existing spline data structure,
+along with a set of data values for each of the domains, and fit splines of
+the specified order (currently, linear only), and set the coefficients in the
+appropriate spline polynomials.  This function is not part of the API in the
+latest SDR, but I'm guessing it will be, and I need it to generate test
+cases, so I included it here.
+ *****************************************************************************/
 
 psSpline1D *psSpline1DGen(const psSpline1D *spline,