Index: trunk/psLib/src/dataManip/psFunctions.c
===================================================================
--- trunk/psLib/src/dataManip/psFunctions.c	(revision 1020)
+++ trunk/psLib/src/dataManip/psFunctions.c	(revision 1022)
@@ -7,6 +7,6 @@
  *  polynomials.  It also contains a Gaussian functions.
  *
- *  @version $Revision: 1.12 $ $Name: not supported by cvs2svn $
- *  @date $Date: 2004-06-14 19:32:42 $
+ *  @version $Revision: 1.13 $ $Name: not supported by cvs2svn $
+ *  @date $Date: 2004-06-14 19:40:14 $
  *
  *  Copyright 2004 Maui High Performance Computing Center, University of Hawaii
@@ -73,5 +73,5 @@
  Gaussian distribution as well.
  
- GUS: There is no way to seed the random generator.
+ NOTE: There is no way to seed the random generator.
  *****************************************************************************/
 psVector *psGaussianDev(float mean,
@@ -94,5 +94,5 @@
     }
 
-    // GUS: Should I free r as well?
+    // NOTE: Should I free r as well?
     return(gauss);
 }
@@ -320,5 +320,5 @@
     float xSum = 1.0;
 
-    // GUS: Do we want to flag this case?
+    // NOTE: Do we want to flag this case?
     if (myPoly->n == 0) {
         return(1.0);
@@ -646,5 +646,5 @@
     double xSum = 1.0;
 
-    // GUS: Do we want to flag this case?
+    // NOTE: Do we want to flag this case?
     if (myPoly->n == 0) {
         return(1.0);
Index: trunk/psLib/src/dataManip/psMinimize.c
===================================================================
--- trunk/psLib/src/dataManip/psMinimize.c	(revision 1020)
+++ trunk/psLib/src/dataManip/psMinimize.c	(revision 1022)
@@ -15,5 +15,5 @@
 #include "float.h"
 #include <math.h>
-// GUS: rewrite so there is no maximum order for the polynomials.
+// NOTE: rewrite so there is no maximum order for the polynomials.
 #define MAX_POLY_ORDER 10
 #define MAX_POLYNOMIAL_TERMS  (((MAX_POLY_ORDER+1) * (MAX_POLY_ORDER + 2)) / 2)
@@ -243,5 +243,5 @@
         }
         col[j] = 1.0;
-        // GUS: substitue the LUD rotine
+        // NOTE: substitue the LUD rotine
         //        lubksb(A, N, indx, col);
         for(i=1;i<=N;i++) {
Index: trunk/psLib/src/dataManip/psStats.c
===================================================================
--- trunk/psLib/src/dataManip/psStats.c	(revision 1020)
+++ trunk/psLib/src/dataManip/psStats.c	(revision 1022)
@@ -95,10 +95,10 @@
     float binSize = 0.0;                // The histogram bin size
 
-    // GUS: Verify that this is the correct action.
+    // NOTE: Verify that this is the correct action.
     if (n == 0) {
         return(NULL);
     }
 
-    // GUS: Verify that this is the correct action.
+    // NOTE: Verify that this is the correct action.
     if (lower > upper) {
         return(NULL);
@@ -146,5 +146,5 @@
     int i;                              // Loop index variable
 
-    // GUS: Verify that this is the correct action.
+    // NOTE: Verify that this is the correct action.
     if (bounds == NULL) {
         //        psAbort(__func__, "psHistogram requested with NULL bounds");
@@ -152,5 +152,5 @@
     }
 
-    // GUS: Verify that this is the correct action.
+    // NOTE: Verify that this is the correct action.
     if (bounds->n <= 1) {
         //        psAbort(__func__, "psHistogram requested with NULL bounds");
@@ -215,10 +215,10 @@
     int numBins = 0;                            // The total number of bins
 
-    // GUS: Verify that this is the correct action.
+    // NOTE: Verify that this is the correct action.
     if (out == NULL) {
         return(NULL);
     }
 
-    // GUS: Verify that this is the correct action.
+    // NOTE: Verify that this is the correct action.
     if (in == NULL) {
         return(out);
@@ -240,5 +240,5 @@
         }
     }
-    // GUS: determine the correct action for a variety of other cases:
+    // NOTE: determine the correct action for a variety of other cases:
     // in vector has 0 elements, and histogram structure has zero bins.
 
@@ -268,5 +268,5 @@
                     // bin number requires a bit more work.
                 } else {
-                    // GUS: This is slow.  Put a smarter algorithm here to
+                    // NOTE: This is slow.  Put a smarter algorithm here to
                     // find the correct bin number (bin search, probably)
                     for (j=0;j<(out->bounds->n)-1;j++) {
@@ -841,5 +841,5 @@
     psVectorFree(unsortedVector);
     psVectorFree(sortedVector);
-    // GUS: This is the
+    // NOTE: This is the
 }
 
@@ -950,5 +950,5 @@
 
     // Fit a Gaussian to the bins in the range MODE-dL to Mode+dL
-    // GUS: This step is dependent on the functions in psMinimize.c being
+    // NOTE: This step is dependent on the functions in psMinimize.c being
     // implemented.  Currently, they are not.
 
@@ -1122,5 +1122,5 @@
 
     // 1. Compute the sample median.
-    // GUS: This seems odd.  Verify with IfA that we want to calculate the
+    // NOTE: This seems odd.  Verify with IfA that we want to calculate the
     // median here, not the mean.
     p_psVectorSampleMedian(myVector, maskVector, maskVal, stats);
@@ -1198,5 +1198,5 @@
                        unsigned int maskVal)
 {
-    // GUS: Verify that this is the correct action.
+    // NOTE: Verify that this is the correct action.
     if (in == NULL) {
         return(stats);
@@ -1237,5 +1237,5 @@
 
     // ************************************************************************
-    // GUS: The Stdev calculation requires the mean.  Should we assume the
+    // NOTE: The Stdev calculation requires the mean.  Should we assume the
     // mean has already been calculated?  Or should we always calculate it?
     if (stats->options & PS_STAT_SAMPLE_STDEV) {