Index: trunk/psLib/src/math/psSpline.c
===================================================================
--- trunk/psLib/src/math/psSpline.c	(revision 3380)
+++ trunk/psLib/src/math/psSpline.c	(revision 3384)
@@ -7,6 +7,6 @@
  *  polynomials.  It also contains a Gaussian functions.
  *
- *  @version $Revision: 1.91 $ $Name: not supported by cvs2svn $
- *  @date $Date: 2005-03-07 20:56:13 $
+ *  @version $Revision: 1.92 $ $Name: not supported by cvs2svn $
+ *  @date $Date: 2005-03-08 02:27:47 $
  *
  *  Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii
@@ -249,9 +249,7 @@
 
     psPolynomial1D **chebPolys = NULL;
-    psS32 i = 0;
-    psS32 j = 0;
 
     chebPolys = (psPolynomial1D **) psAlloc(maxChebyPoly * sizeof(psPolynomial1D *));
-    for (i = 0; i < maxChebyPoly; i++) {
+    for (psS32 i = 0; i < maxChebyPoly; i++) {
         chebPolys[i] = psPolynomial1DAlloc(i + 1, PS_POLYNOMIAL_ORD);
     }
@@ -265,9 +263,9 @@
         chebPolys[1]->coeff[1] = 1;
     }
-    for (i = 2; i < maxChebyPoly; i++) {
-        for (j = 0; j < chebPolys[i - 1]->n; j++) {
+    for (psS32 i = 2; i < maxChebyPoly; i++) {
+        for (psS32 j = 0; j < chebPolys[i - 1]->n; j++) {
             chebPolys[i]->coeff[j + 1] = 2 * chebPolys[i - 1]->coeff[j];
         }
-        for (j = 0; j < chebPolys[i - 2]->n; j++) {
+        for (psS32 j = 0; j < chebPolys[i - 2]->n; j++) {
             chebPolys[i]->coeff[j] -= chebPolys[i - 2]->coeff[j];
         }
@@ -1265,28 +1263,20 @@
 
     psVector *tmp;
-    psVector *myX;
-    psVector *myY;
-    psS32 i;
     psS32 vecLen=x->n;
 
-    vecLen=x->n;
+    // Determine the length of the output vector to by the minimum of the x,y vectors
     if (y->n < vecLen) {
         vecLen = y->n;
     }
 
+    // Create output vector to return
     tmp = psVectorAlloc(vecLen, PS_TYPE_F32);
-    for (i=0;i<vecLen;i++) {
-        tmp->data.F32[i] = psPolynomial2DEval(myPoly,
-                                              myX->data.F32[i],
-                                              myY->data.F32[i]);
-
-    }
-
-    if (x->type.type != PS_TYPE_F32) {
-        psFree(myX);
-    }
-    if (y->type.type != PS_TYPE_F32) {
-        psFree(myY);
-    }
+
+    // Evaluate the polynomial at the specified points
+    for (psS32 i=0; i<vecLen; i++) {
+        tmp->data.F32[i] = psPolynomial2DEval(myPoly,x->data.F32[i],y->data.F32[i]);
+    }
+
+    // Return output vector
     return(tmp);
 }
@@ -1664,28 +1654,20 @@
 
     psVector *tmp;
-    psVector *myX;
-    psVector *myY;
-    psS32 i;
     psS32 vecLen=x->n;
 
-    vecLen=x->n;
+    // Determine the output vector length from minimum length of input vectors
     if (y->n < vecLen) {
         vecLen = y->n;
     }
 
+    // Allocate output vector
     tmp = psVectorAlloc(vecLen, PS_TYPE_F64);
-    for (i=0;i<vecLen;i++) {
-        tmp->data.F64[i] = psDPolynomial2DEval(myPoly,
-                                               myX->data.F64[i],
-                                               myY->data.F64[i]);
-
-    }
-
-    if (x->type.type != PS_TYPE_F64) {
-        psFree(myX);
-    }
-    if (y->type.type != PS_TYPE_F64) {
-        psFree(myY);
-    }
+
+    // Evaluate the polynomial
+    for (psS32 i = 0; i < vecLen; i++) {
+        tmp->data.F64[i] = psDPolynomial2DEval(myPoly,x->data.F64[i],y->data.F64[i]);
+    }
+
+    // Return output vector
     return(tmp);
 }