IPP Software Navigation Tools IPP Links Communication Pan-STARRS Links

Ignore:
Timestamp:
Mar 23, 2004, 10:18:01 AM (22 years ago)
Author:
eugene
Message:

cleaned doxygen comments (one function description per function)
split psLibDesign appendix into group files & updated them

Location:
trunk/archive/pslib/include
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • trunk/archive/pslib/include/psFunctions.h

    r257 r285  
    5555 */
    5656
    57 /** Constructors */
    58 psPolynomial1D *psPolynomial1DAlloc(int n //!< Number of terms
    59                                     );
    60 psPolynomial2D *psPolynomial2DAlloc(int nX, int nY //!< Number of terms in x and y
    61                                     );
    62 psPolynomial3D *psPolynomial3DAlloc(int nX, int nY, int nZ //!< Number of terms in x, y and z
    63                                     );
    64 psPolynomial4D *psPolynomial4DAlloc(int nW, int nX, int nY, int nZ //!< Number of terms in w, x, y and z
    65                                     );
    66 
    67 /** Destructors */
    68 void psPolynomial1DFree(psPolynomial1D *restrict myPoly //!< Polynomial to destroy
    69                         );
    70 void psPolynomial2DFree(psPolynomial2D *restrict myPoly //!< Polynomial to destroy
    71                         );
    72 void psPolynomial3DFree(psPolynomial3D *restrict myPoly //!< Polynomial to destroy
    73                         );
    74 void psPolynomial4DFree(psPolynomial4D *restrict myPoly //!< Polynomial to destroy
    75                         );
    76 
     57/** Constructor */
     58psPolynomial1D *psPolynomial1DAlloc(int n) //!< Number of terms
     59                                    ;
     60/** Constructor */
     61psPolynomial2D *psPolynomial2DAlloc(int nX, int nY) //!< Number of terms in x and y
     62                                    ;
     63/** Constructor */
     64psPolynomial3D *psPolynomial3DAlloc(int nX, int nY, int nZ) //!< Number of terms in x, y and z
     65                                    ;
     66/** Constructor */
     67psPolynomial4D *psPolynomial4DAlloc(int nW, int nX, int nY, int nZ) //!< Number of terms in w, x, y and z
     68                                    ;
     69
     70/** Destructor */
     71void psPolynomial1DFree(psPolynomial1D *restrict myPoly) //!< Polynomial to destroy
     72;
     73     
     74/** Destructor */
     75void psPolynomial2DFree(psPolynomial2D *restrict myPoly) //!< Polynomial to destroy
     76                        ;
     77/** Destructor */
     78void psPolynomial3DFree(psPolynomial3D *restrict myPoly) //!< Polynomial to destroy
     79                        ;
     80/** Destructor */
     81void psPolynomial4DFree(psPolynomial4D *restrict myPoly) //!< Polynomial to destroy
     82                        ;
    7783
    7884/** Evaluate 1D polynomial */
     
    149155 */
    150156
    151 /** Constructors */
     157/** Constructor */
    152158psDPolynomial1D *psDPolynomial1DAlloc(int n //!< Number of terms
    153159    );
     160/** Constructor */
    154161psDPolynomial2D *psDPolynomial2DAlloc(int nX, int nY //!< Number of terms in x and y
    155162    );
     163/** Constructor */
    156164psDPolynomial3D *psDPolynomial3DAlloc(int nX, int nY, int nZ //!< Number of terms in x, y and z
    157165    );
     166/** Constructor */
    158167psDPolynomial4D *psDPolynomial4DAlloc(int nW, int nX, int nY, int nZ //!< Number of terms in w, x, y and z
    159168    );
    160169
    161170
    162 /** Destructors */
     171/** Destructor */
    163172void psDPolynomial1DFree(psDPolynomial1D *restrict myPoly //!< Polynomial to destroy
    164173    );
     174/** Destructor */
    165175void psDPolynomial2DFree(psDPolynomial2D *restrict myPoly //!< Polynomial to destroy
    166176    );
     177/** Destructor */
    167178void psDPolynomial3DFree(psDPolynomial3D *restrict myPoly //!< Polynomial to destroy
    168179    );
     180/** Destructor */
    169181void psDPolynomial4DFree(psDPolynomial4D *restrict myPoly //!< Polynomial to destroy
    170182    );
  • trunk/archive/pslib/include/psMetaData.h

    r257 r285  
    7575/**** Utilities **********************************************************************/
    7676
     77/// Add entry to the end of the metadata set
    7778psMetaDataItem *psMetaDataAppend(psMetaDataSet *restrict ms, psMetaDataItem *restrict item);
     79
     80/// delete entry from the metadata set
    7881psMetaDataItem *psMetaDataRemove(psMetaDataSet *restrict ms, const char *restrict key);
    7982
     83/// reset the iterator to the start of the list
    8084void psMetaDataSetIterator(psMetaDataSet *ms);
     85
     86/// get the next entry in the sequence
    8187psMetaDataItem *psMetaDataGetNext(psMetaDataSet *restrict ms, const char *restrict match);
     88
     89/// find the metadata with the specified key
    8290psMetaDataItem *psMetaDataLookup(const psMetaDataSet *restrict ms, const char *restrict key);
    8391
     92/// print metadata item to the specified stream
    8493void psMetaDataItemPrint(FILE *fd,              // file descriptor to write to
    8594                         const psMetaDataItem *restrict ms, // item of metadata to print
  • trunk/archive/pslib/include/psMinimize.h

    r277 r285  
    2222psFloatArray *
    2323psMinimizeChi2(float (*evalModel)(const psFloatArray *restrict,
    24                                   const psFloatArray *restrict), //!< Model to fit; receives domain and
    25                                                                  //!< parameters
     24                                  const psFloatArray *restrict), //!< Model to fit; (domain and params)
    2625               const psFloatArray *restrict domain, //!< The domain values for the corresponding measurements
    2726               const psFloatArray *restrict data, //!< Data to fit
     
    2928               psFloatArray *restrict initialGuess, //!< Initial guess
    3029               const psIntArray *restrict guessMask //!< 1 = fit for parameter, 0 = hold parameter constant
    31                );
     30    );
    3231
    3332/** Derive a polynomial fit by least-squares --- can be done analytically */
Note: See TracChangeset for help on using the changeset viewer.