Changeset 4122
- Timestamp:
- Jun 6, 2005, 1:40:53 PM (21 years ago)
- Location:
- trunk/doc/pslib
- Files:
-
- 2 edited
-
ChangeLogSDRS.tex (modified) (3 diffs)
-
psLibSDRS.tex (modified) (26 diffs)
Legend:
- Unmodified
- Added
- Removed
-
trunk/doc/pslib/ChangeLogSDRS.tex
r4111 r4122 1 %%% $Id: ChangeLogSDRS.tex,v 1.12 8 2005-06-04 02:38:09jhoblitt Exp $1 %%% $Id: ChangeLogSDRS.tex,v 1.129 2005-06-06 23:40:52 jhoblitt Exp $ 2 2 3 3 \subsection{Changes from version 00 to version 01} … … 629 629 \item change \code{int} $\rightarrow$ \code{size_t} where appropriate 630 630 \item change \code{psBool} $\rightarrow$ \code{bool} 631 \item change \code{psU64} $\rightarrow$ \code{unsigned long int} where appropriate631 \item change \code{psU64} $\rightarrow$ \code{unsigned long} where appropriate 632 632 \item add \code{const} to parameters where appropriate 633 633 \item remove \code{const} from parameters passed by value … … 656 656 \item change blurb about ``Threads'' to clarify requirements 657 657 \item remove \code{lock} from \code{psList} 658 \item change \code{psVector} to store it's number of elements as an \code{long int}659 \item change \code{psArray} to store it's number of elements as an \code{long int}660 \item change \code{psList} to store it's number of elements as an \code{long int}661 \item change \code{psListIterator} to store the number of elements on the list as an \code{long int}662 \item change \code{psListIterator} to store it's index as an \code{long int}663 \item change \code{psHash} to store it's number of elements as an \code{long int}664 \item change \code{psLookupTable} to store it's index as an \code{long int}665 \item change \code{psBitSet} to store it's size as an \code{long int}658 \item change \code{psVector} to store it's number of elements as an \code{long} 659 \item change \code{psArray} to store it's number of elements as an \code{long} 660 \item change \code{psList} to store it's number of elements as an \code{long} 661 \item change \code{psListIterator} to store the number of elements on the list as an \code{long} 662 \item change \code{psListIterator} to store it's index as an \code{long} 663 \item change \code{psHash} to store it's number of elements as an \code{long} 664 \item change \code{psLookupTable} to store it's index as an \code{long} 665 \item change \code{psBitSet} to store it's size as an \code{long} 666 666 \item remove \code{psXMLDocFree()} 667 667 \item add \code{psXMLDocAlloc()} -
trunk/doc/pslib/psLibSDRS.tex
r4110 r4122 1 %%% $Id: psLibSDRS.tex,v 1.26 3 2005-06-04 02:37:24jhoblitt Exp $1 %%% $Id: psLibSDRS.tex,v 1.264 2005-06-06 23:40:53 jhoblitt Exp $ 2 2 \documentclass[panstarrs,spec]{panstarrs} 3 3 … … 1420 1420 typedef struct { 1421 1421 psType type; ///< vector data type and dimension 1422 long int n;///< size of vector1423 const long int nalloc;///< allocated data block1422 long n; ///< size of vector 1423 const long nalloc; ///< allocated data block 1424 1424 union { 1425 1425 psS8 *S8; ///< Pointers to byte data … … 1450 1450 % 1451 1451 \begin{prototype} 1452 psVector *psVectorAlloc(long intnalloc, psElemType type);1453 psVector *psVectorRealloc(psVector *vector, long intnalloc);1454 psVector *psVectorRecycle(psVector *vector, long intnalloc, psElemType type);1452 psVector *psVectorAlloc(long nalloc, psElemType type); 1453 psVector *psVectorRealloc(psVector *vector, long nalloc); 1454 psVector *psVectorRecycle(psVector *vector, long nalloc, psElemType type); 1455 1455 \end{prototype} 1456 1456 % … … 1474 1474 1475 1475 \begin{prototype} 1476 psVector *psVectorExtend(psVector *vector, long int delta, long intnExtend);1476 psVector *psVectorExtend(psVector *vector, long delta, long nExtend); 1477 1477 \end{prototype} 1478 1478 … … 1606 1606 \begin{datatype} 1607 1607 typedef struct { 1608 const long int n;///< size of array1609 const long int nalloc;///< allocated data block1608 const long n; ///< size of array 1609 const long nalloc; ///< allocated data block 1610 1610 void **data; ///< pointer to data block 1611 1611 } psArray; … … 1619 1619 % 1620 1620 \begin{prototype} 1621 psArray *psArrayAlloc(long intnalloc);1622 psArray *psArrayRealloc(psArray *array, long intnalloc);1621 psArray *psArrayAlloc(long nalloc); 1622 psArray *psArrayRealloc(psArray *array, long nalloc); 1623 1623 \end{prototype} 1624 1624 % … … 1637 1637 1638 1638 \begin{prototype} 1639 psArray *psArrayAdd(psArray *array, long intdelta, psPtr data);1639 psArray *psArrayAdd(psArray *array, long delta, psPtr data); 1640 1640 \end{prototype} 1641 1641 … … 1657 1657 1658 1658 \begin{prototype} 1659 bool psArraySet(psArray *array, long intposition, psPtr data);1660 psPtr psArrayGet(const psArray *array, long intposition);1659 bool psArraySet(psArray *array, long position, psPtr data); 1660 psPtr psArrayGet(const psArray *array, long position); 1661 1661 \end{prototype} 1662 1662 … … 1690 1690 \begin{datatype} 1691 1691 typedef struct { 1692 long int n;///< number of elements on list1693 psListElem *head; ///< first element on list (may be NULL)1694 psListElem *tail; ///< last element on list (may be NULL)1695 psArray *iterators; ///< array of psListIterator: iteration cursors1692 long n; ///< number of elements on list 1693 psListElem *head; ///< first element on list (may be NULL) 1694 psListElem *tail; ///< last element on list (may be NULL) 1695 psArray *iterators; ///< array of psListIterator: iteration cursors 1696 1696 } psList; 1697 1697 \end{datatype} … … 1742 1742 \begin{datatype} 1743 1743 typedef struct { 1744 psList *list; ///< List iterator works on1745 psListElem *cursor; ///< The current iterator cursor1746 bool offEnd; ///< Is the iterator off the end?1747 long in t index;///< Index of iterator, to assist performance1748 bool mutable; ///< Is it permissible to modify the list?1744 psList *list; ///< List iterator works on 1745 psListElem *cursor; ///< The current iterator cursor 1746 bool offEnd; ///< Is the iterator off the end? 1747 long index; ///< Index of iterator, to assist performance 1748 bool mutable; ///< Is it permissible to modify the list? 1749 1749 } psListIterator; 1750 1750 \end{datatype} … … 1763 1763 The corresponding constructor shall be: 1764 1764 \begin{prototype} 1765 psListIterator *psListIteratorAlloc(const psList *list, long intlocation, bool mutable);1765 psListIterator *psListIteratorAlloc(const psList *list, long location, bool mutable); 1766 1766 \end{prototype} 1767 1767 Here, \code{list} is the \code{psList} on which the iterator will … … 1791 1791 1792 1792 \begin{prototype} 1793 bool psListAdd(psList *list, long intlocation, psPtr data);1793 bool psListAdd(psList *list, long location, psPtr data); 1794 1794 bool psListAddAfter(psListIterator *iterator, psPtr data); 1795 1795 bool psListAddBefore(psListIterator *iterator, psPtr data); … … 1809 1809 1810 1810 \begin{prototype} 1811 psPtr psListGet(psList *list, long intlocation);1811 psPtr psListGet(psList *list, long location); 1812 1812 psPtr psListGetAndIncrement(psListIterator *iterator); 1813 1813 psPtr psListGetAndDecrement(psListIterator *iterator); … … 1839 1839 1840 1840 \begin{prototype} 1841 bool psListRemove(psList *list, long intlocation)1841 bool psListRemove(psList *list, long location) 1842 1842 bool psListRemoveData(psList *list, psPtr data); 1843 1843 \end{prototype} … … 1900 1900 \begin{datatype} 1901 1901 typedef struct { 1902 long int n;///< number of buckets1902 long n; ///< number of buckets 1903 1903 psHashBucket **buckets; ///< the buckets themselves 1904 1904 } psHash; … … 1922 1922 A hash table is created with the following function: 1923 1923 \begin{prototype} 1924 psHash *psHashAlloc(long intnalloc);1924 psHash *psHashAlloc(long nalloc); 1925 1925 \end{prototype} 1926 1926 which allocates the space for the hash table, creating and … … 1999 1999 const char *filename; ///< File from which data is to be read 2000 2000 const char *format; ///< scanf-like format string for file 2001 long in t indexCol;///< Column of the index vector (starting at zero)2001 long indexCol; ///< Column of the index vector (starting at zero) 2002 2002 psVector *index; ///< Index values 2003 2003 psArray *values; ///< Corresponding values: an array of vectors … … 2023 2023 \begin{prototype} 2024 2024 psLookupTable *psLookupTableAlloc(const char *filename, ///< File from which to read 2025 const char *format, ///< scanf-like format string2026 long in t indexCol///< Column of the index vector (starting at zero)2025 const char *format, ///< scanf-like format string 2026 long indexCol ///< Column of the index vector (starting at zero) 2027 2027 ); 2028 2028 \end{prototype} … … 2035 2035 2036 2036 \begin{prototype} 2037 psLookupTable *psLookupTableImport(psLookupTable *table, ///< Lookup table into which to import2038 const psArray *vectors, ///< Array of vectors2039 long in t indexCol///< Index of the index vector in the array of vectors2037 psLookupTable *psLookupTableImport(psLookupTable *table, ///< Lookup table into which to import 2038 const psArray *vectors, ///< Array of vectors 2039 long indexCol ///< Index of the index vector in the array of vectors 2040 2040 ); 2041 2041 \end{prototype} … … 2055 2055 2056 2056 \begin{prototype} 2057 long intpsLookupTableRead(psLookupTable *table);2057 long psLookupTableRead(psLookupTable *table); 2058 2058 \end{prototype} 2059 2059 \code{psLookupTableRead} combines \code{psVectorsReadFromFile} and … … 2067 2067 functions: 2068 2068 \begin{prototype} 2069 double psLookupTableInterpolate(const psLookupTable *table, double index, long intcolumn, psLookupStatusType *status);2069 double psLookupTableInterpolate(const psLookupTable *table, double index, long column, psLookupStatusType *status); 2070 2070 psVector *psLookupTableInterpolateAll(const psLookupTable *table, double index, psVector *stats); 2071 2071 \end{prototype} … … 2114 2114 \begin{datatype} 2115 2115 typedef struct { 2116 long int n;///< Number of chars that form the bitset2116 long n; ///< Number of chars that form the bitset 2117 2117 char *bits; ///< The bits 2118 2118 } psBitSet; … … 2121 2121 We also require the corresponding constructor and destructor: 2122 2122 \begin{prototype} 2123 psBitSet *psBitSetAlloc(long intnalloc);2123 psBitSet *psBitSetAlloc(long nalloc); 2124 2124 \end{prototype} 2125 2125 where \code{n} is the requested number of bits. … … 2135 2135 2136 2136 \begin{prototype} 2137 psBitSet *psBitSetSet(psBitSet *bitSet, long intbit);2138 psBitSet* psBitSetClear(psBitSet *bitSet, long intbit);2137 psBitSet *psBitSetSet(psBitSet *bitSet, long bit); 2138 psBitSet* psBitSetClear(psBitSet *bitSet, long bit); 2139 2139 psBitSet *psBitSetOp(psBitSet *outBitSet, const psBitSet *inBitSet1, const char *operator, const psBitSet *inBitSet2); 2140 2140 psBitSet *psBitSetNot(psBitSet *outBitSet, const psBitSet *inBitSet); 2141 bool psBitSetTest(const psBitSet *bitSet, long intbit);2141 bool psBitSetTest(const psBitSet *bitSet, long bit); 2142 2142 char *psBitSetToString(const psBitSet* bitSet); 2143 2143 \end{prototype} … … 4726 4726 4727 4727 \begin{prototype} 4728 psArray *psDBSelectColumn(psDB *dbh, const char *tableName, const char *col, unsigned long intlimit);4729 psVector *psDBSelectColumnNum(psDB *dbh, const char *tableName, const char *col, psElemType type, unsigned long intlimit);4728 psArray *psDBSelectColumn(psDB *dbh, const char *tableName, const char *col, unsigned long limit); 4729 psVector *psDBSelectColumnNum(psDB *dbh, const char *tableName, const char *col, psElemType type, unsigned long limit); 4730 4730 \end{prototype} 4731 4731 … … 4738 4738 4739 4739 \begin{prototype} 4740 psArray *psDBSelectRows(psDB *dbh, const char *tableName, psMetadata *where, unsigned long intlimit);4740 psArray *psDBSelectRows(psDB *dbh, const char *tableName, psMetadata *where, unsigned long limit); 4741 4741 \end{prototype} 4742 4742
Note:
See TracChangeset
for help on using the changeset viewer.
