Index: /trunk/doc/pslib/psLibSDRS.tex
===================================================================
--- /trunk/doc/pslib/psLibSDRS.tex	(revision 7557)
+++ /trunk/doc/pslib/psLibSDRS.tex	(revision 7558)
@@ -1,3 +1,3 @@
-%%% $Id: psLibSDRS.tex,v 1.404 2006-06-14 03:42:37 price Exp $
+%%% $Id: psLibSDRS.tex,v 1.405 2006-06-14 03:47:19 price Exp $
 \documentclass[panstarrs,spec]{panstarrs}
 
@@ -4438,5 +4438,5 @@
 
 \begin{prototype}
-bool psFitsWriteTable(psFits* fits, const psMetadata *header, const psArray* table
+bool psFitsWriteTable(psFits* fits, const psMetadata *header, const psArray* table,
                       const char *extname); 
 \end{prototype}
@@ -4889,13 +4889,11 @@
 Of course, we require the appropriate constructors and destructor:
 \begin{prototype}
-psSpline1D *psSpline1DAlloc(unsigned int n, unsigned int order, float min, float max);
-psSpline1D *psSpline1DAllocGeneric(const psVector *bounds, unsigned int order);
-\end{prototype}
-
-\code{psSpline1DAlloc} shall allocate and return a \code{psSpline1D},
-setting the \code{knots} on the basis of the input number of spline
-pieces, \code{n}, and the minimum (\code{min}) and maximum
-(\code{max}) data values.  The spline pieces shall be of the specified
-\code{order}.
+psSpline1D *psSpline1DAlloc(void);
+\end{prototype}
+
+\code{psSpline1DAlloc} shall allocate and return a \code{psSpline1D}.
+Since the number of spline pieces and locations of the knots depends
+on the input data, we do not set those here, but leave them to be set
+by the fitting function.
 
 \code{psSpline1DAllocGeneric} shall allocate and return a
@@ -5790,5 +5788,5 @@
 on the coordinate x,y.
 \begin{prototype}
-psPolynomial2D *psImageBicubeFit (psImage *image, int x, int y);
+psPolynomial2D *psImageBicubeFit(const psImage *image, int x, int y);
 \end{prototype}
 
@@ -5796,5 +5794,5 @@
 polynomial representing the fit to 9 pixels of an image.
 \begin{prototype}
-psPlane psImageBicubeMin (psPolynomial2D *poly);
+psPlane psImageBicubeMin(const psPolynomial2D *poly);
 \end{prototype}
 
@@ -6153,5 +6151,5 @@
 only add elements above the diagonal.
 \begin{prototype}
-void psSparseMatrixElement(psSparse *sparse, int i, int j, float value);
+bool psSparseMatrixElement(psSparse *sparse, int i, int j, float value);
 \end{prototype}
 
@@ -6172,5 +6170,5 @@
 function before attempting to solve, but after populating, the matrix and vector:
 \begin{prototype}
-void psSparseResort(psSparse *sparse);
+bool psSparseResort(psSparse *sparse);
 \end{prototype}
 
@@ -6178,5 +6176,5 @@
 \bar{Bf}$.  For the value of $\bar{x}$, a good starting guess is the vector $\bar{Bf}$
 \begin{prototype}
-psVector *psSparseSolve(psVector *guess, psSparseConstraint constraint,
+psVector *psSparseSolve(psVector *output, psSparseConstraint constraint,
                         const psSparse *sparse, int Niter);
 \end{prototype}