Index: trunk/psLib/src/imageops/psImageStats.c
===================================================================
--- trunk/psLib/src/imageops/psImageStats.c	(revision 5841)
+++ trunk/psLib/src/imageops/psImageStats.c	(revision 6186)
@@ -9,6 +9,6 @@
  *  @author GLG, MHPCC
  *
- *  @version $Revision: 1.86 $ $Name: not supported by cvs2svn $
- *  @date $Date: 2005-12-24 00:33:17 $
+ *  @version $Revision: 1.87 $ $Name: not supported by cvs2svn $
+ *  @date $Date: 2006-01-23 22:25:31 $
  *
  *  Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii
@@ -212,34 +212,4 @@
 
     return (scalingFactors);
-}
-
-// XXX: Use a static array of Chebyshev polynomials.
-psPolynomial1D **p_psCreateChebyshevPolys(psS32 maxChebyPoly)
-{
-    PS_ASSERT_INT_POSITIVE(maxChebyPoly, NULL);
-    psPolynomial1D **chebPolys = NULL;
-    psS32 i = 0;
-    psS32 j = 0;
-
-    chebPolys = (psPolynomial1D **) psAlloc(maxChebyPoly * sizeof(psPolynomial1D *));
-    for (i = 0; i < maxChebyPoly; i++) {
-        // XXX: verify this, poly nOrder/nTerms change.
-        chebPolys[i] = psPolynomial1DAlloc(i, PS_POLYNOMIAL_ORD);
-    }
-
-    // Create the Chebyshev polynomials.
-    // Polynomial i has i-th order.
-    chebPolys[0]->coeff[0] = 1;
-    chebPolys[1]->coeff[1] = 1;
-    for (i = 2; i < maxChebyPoly; i++) {
-        for (j = 0; j < (1 + chebPolys[i - 1]->nX); j++) {
-            chebPolys[i]->coeff[j + 1] = 2 * chebPolys[i - 1]->coeff[j];
-        }
-        for (j = 0; j < (1 + chebPolys[i - 2]->nX); j++) {
-            chebPolys[i]->coeff[j] -= chebPolys[i - 2]->coeff[j];
-        }
-    }
-
-    return (chebPolys);
 }
 
@@ -302,5 +272,5 @@
     // Determine how many Chebyshev polynomials
     // are needed, then create them.
-    // XXX: recorde or verify the poly order/nterm change
+    // XXX: record or verify the poly order/nterm change
     maxChebyPoly = coeffs->nX;
     if (coeffs->nY > coeffs->nX) {