Index: /trunk/psLib/test/dataManip/tst_psFunc00.c
===================================================================
--- /trunk/psLib/test/dataManip/tst_psFunc00.c	(revision 2789)
+++ /trunk/psLib/test/dataManip/tst_psFunc00.c	(revision 2790)
@@ -23,6 +23,39 @@
 #define CN 6
 #define DN 8
+
+// XXX: This test comes from Paul Price.  We should add into the code.
+#define ORDER 3
+#define BAD 1
+int t01()
+{
+    psPolynomial1D *poly = psPolynomial1DAlloc(ORDER, PS_POLYNOMIAL_ORD);
+
+    for (int i = 0; i < poly->n; i++) {
+        poly->coeff[i] = (float)i;
+        if (i == BAD) {
+            poly->mask[i] = 1;  // Don't use this coefficient!
+        } else {
+            poly->mask[i] = 0;
+        }
+    }
+
+    fprintf(stderr,"Value using mask: %f\n", psPolynomial1DEval(poly, 0.5));
+
+    // A different method of doing the same thing
+    poly->coeff[BAD] = 0.0;
+    poly->mask[BAD] = 0;
+
+    fprintf(stderr,"Value using coefficient zeroing: %f\n", psPolynomial1DEval(poly, 0.5));
+
+    psFree(poly);
+
+    return(0);
+}
+
+
 psS32 main()
 {
+    t01();
+
     psPolynomial1D *my1DPoly = NULL;
     psPolynomial2D *my2DPoly = NULL;
@@ -605,2 +638,3 @@
     return (!testStatus);
 }
+