Index: trunk/psLib/src/math/psFunctions.c
===================================================================
--- trunk/psLib/src/math/psFunctions.c	(revision 4570)
+++ trunk/psLib/src/math/psFunctions.c	(revision 4580)
@@ -1,20 +1,20 @@
 /** @file  psFunctions.c
- *
- *  @brief Contains basic function allocation, deallocation, and evaluation
- *         routines.
- *
- *  This file will hold the functions for allocated, freeing, and evaluating
- *  polynomials.  It also contains a Gaussian functions.
- *
- *  @version $Revision: 1.4 $ $Name: not supported by cvs2svn $
- *  @date $Date: 2005-07-16 00:42:28 $
- *
- *  Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii
- *
- *  XXX: Should the "coeffErr[]" be used as well?  Bug ???.  Ignore coeffErr
- *
- *  XXX: In the various polyAlloc(n) functions, n is really the order of the
- *  polynomial plus 1.  To create a 2nd-order polynomial, n == 3.
- */
+*
+*  @brief Contains basic function allocation, deallocation, and evaluation
+*         routines.
+*
+*  This file will hold the functions for allocated, freeing, and evaluating
+*  polynomials.  It also contains a Gaussian functions.
+*
+*  @version $Revision: 1.5 $ $Name: not supported by cvs2svn $
+*  @date $Date: 2005-07-19 02:55:54 $
+*
+*  Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii
+*
+*  XXX: Should the "coeffErr[]" be used as well?  Bug ???.  Ignore coeffErr
+*
+*  XXX: In the various polyAlloc(n) functions, n is really the order of the
+*  polynomial plus 1.  To create a 2nd-order polynomial, n == 3.
+*/
 /*****************************************************************************/
 /*  INCLUDE FILES                                                            */
@@ -1918,5 +1918,5 @@
     for (psS32 i=0;i<bounds->n-1;i++) {
         if (FLT_EPSILON >= fabs(bounds->data.F32[i+1]-bounds->data.F32[i])) {
-            psError(PS_ERR_UNKNOWN, true, "data points must be distinct\n");
+            psError(PS_ERR_UNKNOWN, true, "data points must be distinct ([%d] %f %f)\n", i, bounds->data.F32[i], bounds->data.F32[i+1]);
             return(NULL);
         }