Index: /trunk/psLib/src/dataManip/psMinimize.c
===================================================================
--- /trunk/psLib/src/dataManip/psMinimize.c	(revision 1190)
+++ /trunk/psLib/src/dataManip/psMinimize.c	(revision 1191)
@@ -790,4 +790,5 @@
     }
 
+    // Build the B and A data structs.
     for(k=0;k<(polyOrder);k++) {
         for (i=0;i<X->n;i++) {
Index: /trunk/psLib/src/math/psMinimize.c
===================================================================
--- /trunk/psLib/src/math/psMinimize.c	(revision 1190)
+++ /trunk/psLib/src/math/psMinimize.c	(revision 1191)
@@ -790,4 +790,5 @@
     }
 
+    // Build the B and A data structs.
     for(k=0;k<(polyOrder);k++) {
         for (i=0;i<X->n;i++) {
Index: /trunk/psLib/src/math/psMinimize.h
===================================================================
--- /trunk/psLib/src/math/psMinimize.h	(revision 1190)
+++ /trunk/psLib/src/math/psMinimize.h	(revision 1191)
@@ -38,5 +38,5 @@
 /** Derive a polynomial fit by chi^2 minimisation (analytically) */
 psPolynomial1D *
-psGetArrayPolynomial(psPolynomial1D myPoly, ///< Polynomial to fit
+psGetArrayPolynomial(psPolynomial1D *myPoly, ///< Polynomial to fit
                      const psVector *restrict x, ///< Ordinates (or NULL to just use the indices)
                      const psVector *restrict y, ///< Coordinates