Changeset 4312
- Timestamp:
- Jun 17, 2005, 2:53:32 PM (21 years ago)
- Location:
- trunk/psLib/src
- Files:
-
- 16 edited
-
collections/psArray.c (modified) (3 diffs)
-
collections/psArray.h (modified) (3 diffs)
-
collections/psBitSet.c (modified) (4 diffs)
-
collections/psBitSet.h (modified) (6 diffs)
-
collections/psList.c (modified) (2 diffs)
-
collections/psList.h (modified) (2 diffs)
-
dataIO/psDB.c (modified) (6 diffs)
-
dataIO/psDB.h (modified) (5 diffs)
-
db/psDB.c (modified) (6 diffs)
-
db/psDB.h (modified) (5 diffs)
-
types/psArray.c (modified) (3 diffs)
-
types/psArray.h (modified) (3 diffs)
-
types/psBitSet.c (modified) (4 diffs)
-
types/psBitSet.h (modified) (6 diffs)
-
types/psList.c (modified) (2 diffs)
-
types/psList.h (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
trunk/psLib/src/collections/psArray.c
r4307 r4312 9 9 * @author Ross Harman, MHPCC 10 10 * 11 * @version $Revision: 1.2 8$ $Name: not supported by cvs2svn $12 * @date $Date: 2005-06-1 7 23:39:51$11 * @version $Revision: 1.29 $ $Name: not supported by cvs2svn $ 12 * @date $Date: 2005-06-18 00:53:32 $ 13 13 * 14 14 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 86 86 } 87 87 88 psArray* psArrayAdd(psArray* psArr,89 intdelta,88 psArray* psArrayAdd(psArray* array, 89 long delta, 90 90 psPtr data) 91 91 { 92 if ( psArr== NULL) {93 return psArr;94 } 95 96 int n = psArr->n;97 98 if (n >= psArr->nalloc) {92 if (array == NULL) { 93 return array; 94 } 95 96 int n = array->n; 97 98 if (n >= array->nalloc) { 99 99 // array needs to be expanded to make room for more elements 100 100 int d = (delta > 0) ? delta : 10; // as spec'ed in SDRS. 101 psArr = psArrayRealloc(psArr, n+d);101 array = psArrayRealloc(array, n+d); 102 102 } 103 103 104 104 // add the element to the end of the array. 105 psArr->data[n] = psMemIncrRefCounter(data);106 psArr->n = n+1;107 108 return psArr;105 array->data[n] = psMemIncrRefCounter(data); 106 array->n = n+1; 107 108 return array; 109 109 } 110 110 … … 147 147 } 148 148 149 psArray* psArraySort(psArray* in, psComparePtrFcn compare)150 { 151 if ( in== NULL) {152 return NULL; 153 } 154 155 qsort( in->data, in->n, sizeof(psPtr), (int (*)(const void* , const void*))compare);156 157 return in;149 psArray* psArraySort(psArray* array, psComparePtrFcn func) 150 { 151 if (array == NULL) { 152 return NULL; 153 } 154 155 qsort(array->data, array->n, sizeof(psPtr), (int (*)(const void* , const void*))func); 156 157 return array; 158 158 } 159 159 -
trunk/psLib/src/collections/psArray.h
r4307 r4312 12 12 * @author Ross Harman, MHPCC 13 13 * 14 * @version $Revision: 1.2 4$ $Name: not supported by cvs2svn $15 * @date $Date: 2005-06-1 7 23:39:51$14 * @version $Revision: 1.25 $ $Name: not supported by cvs2svn $ 15 * @date $Date: 2005-06-18 00:53:32 $ 16 16 * 17 17 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 77 77 */ 78 78 psArray* psArrayAdd( 79 psArray* psArr, ///< array to operate on80 intdelta,79 psArray* array, ///< array to operate on 80 long delta, 81 81 ///< the amount to expand array, if necessary. If less than one, 10 will be used. 82 82 psPtr data ///< the data pointer to add to psArray … … 122 122 */ 123 123 psArray* psArraySort( 124 psArray* in, ///< input array to sort.125 psComparePtrFcn compare///< the compare function124 psArray* array, ///< input array to sort. 125 psComparePtrFcn func ///< the compare function 126 126 ); 127 127 -
trunk/psLib/src/collections/psBitSet.c
r3682 r4312 11 11 * @author Robert DeSonia, MHPCC 12 12 * 13 * @version $Revision: 1.2 4$ $Name: not supported by cvs2svn $14 * @date $Date: 2005-0 4-07 20:27:41$13 * @version $Revision: 1.25 $ $Name: not supported by cvs2svn $ 14 * @date $Date: 2005-06-18 00:53:32 $ 15 15 * 16 16 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 66 66 } 67 67 68 psBitSet* psBitSetAlloc( psS32 n)68 psBitSet* psBitSetAlloc(long nalloc) 69 69 { 70 70 psS32 numBytes = 0; 71 71 psBitSet* newObj = NULL; 72 72 73 if (n < 0) {73 if (nalloc < 0) { 74 74 psError(PS_ERR_BAD_PARAMETER_VALUE, true, 75 75 PS_ERRORTEXT_psBitSet_ALLOC_NEG_SIZE, 76 n );77 return NULL; 78 } 79 80 numBytes = ceil(n / 8.0);76 nalloc); 77 return NULL; 78 } 79 80 numBytes = ceil(nalloc / 8.0); 81 81 newObj = psAlloc(sizeof(psBitSet)); 82 82 psMemSetDeallocator(newObj, (psFreeFcn) bitSetFree); … … 92 92 } 93 93 94 psBitSet* psBitSetSet(psBitSet* inBitSet,95 psS32bit)94 psBitSet* psBitSetSet(psBitSet* bitSet, 95 long bit) 96 96 { 97 97 char *byte = NULL; 98 98 99 if ( inBitSet == NULL) {99 if (bitSet == NULL) { 100 100 psError(PS_ERR_BAD_PARAMETER_NULL, true, 101 101 PS_ERRORTEXT_psBitSet_SET_NULL); 102 return inBitSet;102 return bitSet; 103 103 } else if ( (bit < 0) || 104 (bit > inBitSet->n * 8 - 1) ) {104 (bit > bitSet->n * 8 - 1) ) { 105 105 psError(PS_ERR_BAD_PARAMETER_VALUE, true, 106 106 PS_ERRORTEXT_psBitSet_BIT_OUTOFRANGE, 107 bit, inBitSet->n * 8 - 1);108 return inBitSet;107 bit,bitSet->n * 8 - 1); 108 return bitSet; 109 109 } 110 110 // Variable byte is the byte in the array that contains the bit to be set 111 byte = inBitSet->bits + bit / 8;111 byte = bitSet->bits + bit / 8; 112 112 *byte |= mask(bit); 113 113 114 return inBitSet;115 } 116 117 psBitSet* psBitSetClear(psBitSet* inBitSet,118 psS32bit)114 return bitSet; 115 } 116 117 psBitSet* psBitSetClear(psBitSet* bitSet, 118 long bit) 119 119 { 120 120 char *byte = NULL; 121 121 122 if ( inBitSet == NULL) {122 if (bitSet == NULL) { 123 123 psError(PS_ERR_BAD_PARAMETER_NULL, true, 124 124 PS_ERRORTEXT_psBitSet_SET_NULL); 125 return inBitSet;125 return bitSet; 126 126 } else if ( (bit < 0) || 127 (bit > inBitSet->n * 8 - 1) ) {127 (bit > bitSet->n * 8 - 1) ) { 128 128 psError(PS_ERR_BAD_PARAMETER_VALUE, true, 129 129 PS_ERRORTEXT_psBitSet_BIT_OUTOFRANGE, 130 bit, inBitSet->n * 8 - 1);131 return inBitSet;130 bit,bitSet->n * 8 - 1); 131 return bitSet; 132 132 } 133 133 // Variable byte is the byte in the array that contains the bit to be set 134 byte = inBitSet->bits + bit / 8;134 byte = bitSet->bits + bit / 8; 135 135 *byte &= ! mask(bit); 136 136 137 return inBitSet;138 } 139 140 psBool psBitSetTest(const psBitSet* inBitSet,141 psS32bit)137 return bitSet; 138 } 139 140 bool psBitSetTest(const psBitSet* bitSet, 141 long bit) 142 142 { 143 143 char *byte = NULL; 144 144 145 if ( inBitSet == NULL) {145 if (bitSet == NULL) { 146 146 psError(PS_ERR_BAD_PARAMETER_NULL, true, 147 147 PS_ERRORTEXT_psBitSet_SET_NULL); 148 148 return false; 149 149 } else if ( (bit < 0) || 150 (bit > inBitSet->n * 8 - 1) ) {150 (bit > bitSet->n * 8 - 1) ) { 151 151 psError(PS_ERR_BAD_PARAMETER_VALUE, true, 152 152 PS_ERRORTEXT_psBitSet_BIT_OUTOFRANGE, 153 bit, inBitSet->n * 8 - 1);153 bit,bitSet->n * 8 - 1); 154 154 return false; 155 155 } 156 156 157 157 // Variable byte is the byte in the array that contains the bit to be tested 158 byte = inBitSet->bits + bit / 8;158 byte = bitSet->bits + bit / 8; 159 159 return ((*byte & mask(bit)) != 0); 160 160 } … … 162 162 psBitSet* psBitSetOp(psBitSet* outBitSet, 163 163 const psBitSet* inBitSet1, 164 c har *operator,164 const char *operator, 165 165 const psBitSet* inBitSet2) 166 166 { -
trunk/psLib/src/collections/psBitSet.h
r4162 r4312 12 12 * @author Ross Harman, MHPCC 13 13 * 14 * @version $Revision: 1.1 8$ $Name: not supported by cvs2svn $15 * @date $Date: 2005-06- 08 23:40:45$14 * @version $Revision: 1.19 $ $Name: not supported by cvs2svn $ 15 * @date $Date: 2005-06-18 00:53:32 $ 16 16 * 17 17 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 56 56 /*@null@*/ 57 57 psBitSet* psBitSetAlloc( 58 psS32 n///< Number of bits in psBitSet array58 long nalloc ///< Number of bits in psBitSet array 59 59 ); 60 60 … … 69 69 psBitSet* psBitSetSet( 70 70 /* @returned@ */ 71 psBitSet* inMask, ///< Pointer to psBitSet to be set.72 psS32bit ///< Bit to be set.71 psBitSet* bitSet, ///< Pointer to psBitSet to be set. 72 long bit ///< Bit to be set. 73 73 ); 74 74 … … 83 83 psBitSet* psBitSetClear( 84 84 /* @returned@ */ 85 psBitSet* inMask, ///< Pointer to psBitSet to be cleared.86 psS32 bit///< Bit to be cleared.85 psBitSet* bitSet, ///< Pointer to psBitSet to be cleared. 86 long bit ///< Bit to be cleared. 87 87 ); 88 88 … … 97 97 */ 98 98 99 psBool psBitSetTest(100 const psBitSet* inMask, ///< Pointer psBitSet to be tested.101 psS32 bit///< Bit to be tested.99 bool psBitSetTest( 100 const psBitSet* bitSet, ///< Pointer psBitSet to be tested. 101 long bit ///< Bit to be tested. 102 102 ); 103 103 … … 111 111 psBitSet* psBitSetOp( 112 112 /* @returned@ */ 113 psBitSet* out Mask, ///< Resulting psBitSet from binary operation114 const psBitSet* in Mask1, ///< First psBitSet on which to operate115 c har *operator, ///< Bit operation116 const psBitSet* in Mask2 ///< First psBitSet on which to operate113 psBitSet* outBitSet, ///< Resulting psBitSet from binary operation 114 const psBitSet* inBitSet1, ///< First psBitSet on which to operate 115 const char *operator, ///< Bit operation 116 const psBitSet* inBitSet2 ///< First psBitSet on which to operate 117 117 ); 118 118 -
trunk/psLib/src/collections/psList.c
r3682 r4312 6 6 * @author Robert Daniel DeSonia, MHPCC 7 7 * 8 * @version $Revision: 1.3 5$ $Name: not supported by cvs2svn $9 * @date $Date: 2005-0 4-07 20:27:41$8 * @version $Revision: 1.36 $ $Name: not supported by cvs2svn $ 9 * @date $Date: 2005-06-18 00:53:32 $ 10 10 * 11 11 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 592 592 } 593 593 594 psList* psArrayToList( psArray* arr)594 psList* psArrayToList(const psArray* array) 595 595 { 596 596 psU32 n; 597 597 psList* list; // list of elements 598 598 599 if (arr == NULL) {599 if (array == NULL) { 600 600 return NULL; 601 601 } 602 602 603 603 list = psListAlloc(NULL); 604 n = arr ->n;604 n = array->n; 605 605 for (psS32 i = 0; i < n; i++) { 606 psListAdd(list, PS_LIST_TAIL, arr ->data[i]);606 psListAdd(list, PS_LIST_TAIL, array->data[i]); 607 607 } 608 608 -
trunk/psLib/src/collections/psList.h
r4162 r4312 7 7 * @ingroup LinkedList 8 8 * 9 * @version $Revision: 1.2 4$ $Name: not supported by cvs2svn $10 * @date $Date: 2005-06- 08 23:40:45$9 * @version $Revision: 1.25 $ $Name: not supported by cvs2svn $ 10 * @date $Date: 2005-06-18 00:53:32 $ 11 11 * 12 12 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 205 205 */ 206 206 psList* psArrayToList( 207 psArray* arr///< vector to convert207 const psArray* array ///< vector to convert 208 208 ); 209 209 -
trunk/psLib/src/dataIO/psDB.c
r4311 r4312 12 12 * @author Joshua Hoblitt 13 13 * 14 * @version $Revision: 1.2 8$ $Name: not supported by cvs2svn $15 * @date $Date: 2005-06-18 00:5 2:56$14 * @version $Revision: 1.29 $ $Name: not supported by cvs2svn $ 15 * @date $Date: 2005-06-18 00:53:32 $ 16 16 * 17 17 * Copyright 2005 Joshua Hoblitt, University of Hawaii … … 244 244 } 245 245 246 psArray *psDBSelectColumn(psDB *dbh, const char *tableName, const char *col, psU64limit)246 psArray *psDBSelectColumn(psDB *dbh, const char *tableName, const char *col, unsigned long long limit) 247 247 { 248 248 MYSQL_RES *result; // complete db result set … … 339 339 } 340 340 341 psVector *psDBSelectColumnNum(psDB *dbh, const char *tableName, const char *col, psElemType pType, const psU64limit)341 psVector *psDBSelectColumnNum(psDB *dbh, const char *tableName, const char *col, psElemType type, unsigned long long limit) 342 342 { 343 343 psArray *stringColumn; // source psArray … … 350 350 } 351 351 352 column = psVectorAlloc(stringColumn->n, pType);352 column = psVectorAlloc(stringColumn->n, type); 353 353 354 354 // conversion functions are a portability issue 355 switch ( pType) {355 switch (type) { 356 356 case PS_TYPE_S8: 357 357 PS_STR_ARRAY_TO_PTYPE(column->data.S8, stringColumn, atoi, psS8, PS_TYPE_S8); … … 403 403 } 404 404 405 psArray *psDBSelectRows(psDB *dbh, const char *tableName, psMetadata *where, const psU64limit)405 psArray *psDBSelectRows(psDB *dbh, const char *tableName, psMetadata *where, unsigned long long limit) 406 406 { 407 407 MYSQL_RES *result; // complete db result set … … 536 536 } 537 537 538 bool psDBInsertRows(psDB *dbh, const char *tableName, psArray *rowSet)538 bool psDBInsertRows(psDB *dbh, const char *tableName, const psArray *rowSet) 539 539 { 540 540 psMetadata *row; // row of data -
trunk/psLib/src/dataIO/psDB.h
r4128 r4312 10 10 * @author Joshua Hoblitt 11 11 * 12 * @version $Revision: 1. 7$ $Name: not supported by cvs2svn $13 * @date $Date: 2005-06- 07 02:29:44$12 * @version $Revision: 1.8 $ $Name: not supported by cvs2svn $ 13 * @date $Date: 2005-06-18 00:53:32 $ 14 14 * 15 15 * Copyright 2005 Joshua Hoblitt, University of Hawaii … … 143 143 const char *tableName, ///< Table name 144 144 const char *col, ///< Column name 145 const psU64limit ///< Maximum number of elements to return145 unsigned long long limit ///< Maximum number of elements to return 146 146 ); 147 147 … … 158 158 const char *tableName, ///< Table name 159 159 const char *col, ///< Column name 160 psElemType pType, ///< Resulting psVector type161 const psU64 limit///< Maximum number of elements to return160 psElemType type, ///< Resulting psVector type 161 unsigned long long limit ///< Maximum number of elements to return 162 162 ); 163 163 … … 179 179 psDB *dbh, ///< Database handle 180 180 const char *tableName, ///< Table name 181 psMetadata *where, ///< Row match criteria182 const psU64 limit///< Maximum number of elements to return181 psMetadata *where, ///< Row match criteria 182 unsigned long long limit ///< Maximum number of elements to return 183 183 ); 184 184 … … 212 212 psDB *dbh, ///< Database handle 213 213 const char *tableName, ///< Table name 214 psArray *rowSet ///< Set of rows to insert214 const psArray *rowSet ///< Set of rows to insert 215 215 ); 216 216 -
trunk/psLib/src/db/psDB.c
r4311 r4312 12 12 * @author Joshua Hoblitt 13 13 * 14 * @version $Revision: 1.2 8$ $Name: not supported by cvs2svn $15 * @date $Date: 2005-06-18 00:5 2:56$14 * @version $Revision: 1.29 $ $Name: not supported by cvs2svn $ 15 * @date $Date: 2005-06-18 00:53:32 $ 16 16 * 17 17 * Copyright 2005 Joshua Hoblitt, University of Hawaii … … 244 244 } 245 245 246 psArray *psDBSelectColumn(psDB *dbh, const char *tableName, const char *col, psU64limit)246 psArray *psDBSelectColumn(psDB *dbh, const char *tableName, const char *col, unsigned long long limit) 247 247 { 248 248 MYSQL_RES *result; // complete db result set … … 339 339 } 340 340 341 psVector *psDBSelectColumnNum(psDB *dbh, const char *tableName, const char *col, psElemType pType, const psU64limit)341 psVector *psDBSelectColumnNum(psDB *dbh, const char *tableName, const char *col, psElemType type, unsigned long long limit) 342 342 { 343 343 psArray *stringColumn; // source psArray … … 350 350 } 351 351 352 column = psVectorAlloc(stringColumn->n, pType);352 column = psVectorAlloc(stringColumn->n, type); 353 353 354 354 // conversion functions are a portability issue 355 switch ( pType) {355 switch (type) { 356 356 case PS_TYPE_S8: 357 357 PS_STR_ARRAY_TO_PTYPE(column->data.S8, stringColumn, atoi, psS8, PS_TYPE_S8); … … 403 403 } 404 404 405 psArray *psDBSelectRows(psDB *dbh, const char *tableName, psMetadata *where, const psU64limit)405 psArray *psDBSelectRows(psDB *dbh, const char *tableName, psMetadata *where, unsigned long long limit) 406 406 { 407 407 MYSQL_RES *result; // complete db result set … … 536 536 } 537 537 538 bool psDBInsertRows(psDB *dbh, const char *tableName, psArray *rowSet)538 bool psDBInsertRows(psDB *dbh, const char *tableName, const psArray *rowSet) 539 539 { 540 540 psMetadata *row; // row of data -
trunk/psLib/src/db/psDB.h
r4128 r4312 10 10 * @author Joshua Hoblitt 11 11 * 12 * @version $Revision: 1. 7$ $Name: not supported by cvs2svn $13 * @date $Date: 2005-06- 07 02:29:44$12 * @version $Revision: 1.8 $ $Name: not supported by cvs2svn $ 13 * @date $Date: 2005-06-18 00:53:32 $ 14 14 * 15 15 * Copyright 2005 Joshua Hoblitt, University of Hawaii … … 143 143 const char *tableName, ///< Table name 144 144 const char *col, ///< Column name 145 const psU64limit ///< Maximum number of elements to return145 unsigned long long limit ///< Maximum number of elements to return 146 146 ); 147 147 … … 158 158 const char *tableName, ///< Table name 159 159 const char *col, ///< Column name 160 psElemType pType, ///< Resulting psVector type161 const psU64 limit///< Maximum number of elements to return160 psElemType type, ///< Resulting psVector type 161 unsigned long long limit ///< Maximum number of elements to return 162 162 ); 163 163 … … 179 179 psDB *dbh, ///< Database handle 180 180 const char *tableName, ///< Table name 181 psMetadata *where, ///< Row match criteria182 const psU64 limit///< Maximum number of elements to return181 psMetadata *where, ///< Row match criteria 182 unsigned long long limit ///< Maximum number of elements to return 183 183 ); 184 184 … … 212 212 psDB *dbh, ///< Database handle 213 213 const char *tableName, ///< Table name 214 psArray *rowSet ///< Set of rows to insert214 const psArray *rowSet ///< Set of rows to insert 215 215 ); 216 216 -
trunk/psLib/src/types/psArray.c
r4307 r4312 9 9 * @author Ross Harman, MHPCC 10 10 * 11 * @version $Revision: 1.2 8$ $Name: not supported by cvs2svn $12 * @date $Date: 2005-06-1 7 23:39:51$11 * @version $Revision: 1.29 $ $Name: not supported by cvs2svn $ 12 * @date $Date: 2005-06-18 00:53:32 $ 13 13 * 14 14 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 86 86 } 87 87 88 psArray* psArrayAdd(psArray* psArr,89 intdelta,88 psArray* psArrayAdd(psArray* array, 89 long delta, 90 90 psPtr data) 91 91 { 92 if ( psArr== NULL) {93 return psArr;94 } 95 96 int n = psArr->n;97 98 if (n >= psArr->nalloc) {92 if (array == NULL) { 93 return array; 94 } 95 96 int n = array->n; 97 98 if (n >= array->nalloc) { 99 99 // array needs to be expanded to make room for more elements 100 100 int d = (delta > 0) ? delta : 10; // as spec'ed in SDRS. 101 psArr = psArrayRealloc(psArr, n+d);101 array = psArrayRealloc(array, n+d); 102 102 } 103 103 104 104 // add the element to the end of the array. 105 psArr->data[n] = psMemIncrRefCounter(data);106 psArr->n = n+1;107 108 return psArr;105 array->data[n] = psMemIncrRefCounter(data); 106 array->n = n+1; 107 108 return array; 109 109 } 110 110 … … 147 147 } 148 148 149 psArray* psArraySort(psArray* in, psComparePtrFcn compare)150 { 151 if ( in== NULL) {152 return NULL; 153 } 154 155 qsort( in->data, in->n, sizeof(psPtr), (int (*)(const void* , const void*))compare);156 157 return in;149 psArray* psArraySort(psArray* array, psComparePtrFcn func) 150 { 151 if (array == NULL) { 152 return NULL; 153 } 154 155 qsort(array->data, array->n, sizeof(psPtr), (int (*)(const void* , const void*))func); 156 157 return array; 158 158 } 159 159 -
trunk/psLib/src/types/psArray.h
r4307 r4312 12 12 * @author Ross Harman, MHPCC 13 13 * 14 * @version $Revision: 1.2 4$ $Name: not supported by cvs2svn $15 * @date $Date: 2005-06-1 7 23:39:51$14 * @version $Revision: 1.25 $ $Name: not supported by cvs2svn $ 15 * @date $Date: 2005-06-18 00:53:32 $ 16 16 * 17 17 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 77 77 */ 78 78 psArray* psArrayAdd( 79 psArray* psArr, ///< array to operate on80 intdelta,79 psArray* array, ///< array to operate on 80 long delta, 81 81 ///< the amount to expand array, if necessary. If less than one, 10 will be used. 82 82 psPtr data ///< the data pointer to add to psArray … … 122 122 */ 123 123 psArray* psArraySort( 124 psArray* in, ///< input array to sort.125 psComparePtrFcn compare///< the compare function124 psArray* array, ///< input array to sort. 125 psComparePtrFcn func ///< the compare function 126 126 ); 127 127 -
trunk/psLib/src/types/psBitSet.c
r3682 r4312 11 11 * @author Robert DeSonia, MHPCC 12 12 * 13 * @version $Revision: 1.2 4$ $Name: not supported by cvs2svn $14 * @date $Date: 2005-0 4-07 20:27:41$13 * @version $Revision: 1.25 $ $Name: not supported by cvs2svn $ 14 * @date $Date: 2005-06-18 00:53:32 $ 15 15 * 16 16 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 66 66 } 67 67 68 psBitSet* psBitSetAlloc( psS32 n)68 psBitSet* psBitSetAlloc(long nalloc) 69 69 { 70 70 psS32 numBytes = 0; 71 71 psBitSet* newObj = NULL; 72 72 73 if (n < 0) {73 if (nalloc < 0) { 74 74 psError(PS_ERR_BAD_PARAMETER_VALUE, true, 75 75 PS_ERRORTEXT_psBitSet_ALLOC_NEG_SIZE, 76 n );77 return NULL; 78 } 79 80 numBytes = ceil(n / 8.0);76 nalloc); 77 return NULL; 78 } 79 80 numBytes = ceil(nalloc / 8.0); 81 81 newObj = psAlloc(sizeof(psBitSet)); 82 82 psMemSetDeallocator(newObj, (psFreeFcn) bitSetFree); … … 92 92 } 93 93 94 psBitSet* psBitSetSet(psBitSet* inBitSet,95 psS32bit)94 psBitSet* psBitSetSet(psBitSet* bitSet, 95 long bit) 96 96 { 97 97 char *byte = NULL; 98 98 99 if ( inBitSet == NULL) {99 if (bitSet == NULL) { 100 100 psError(PS_ERR_BAD_PARAMETER_NULL, true, 101 101 PS_ERRORTEXT_psBitSet_SET_NULL); 102 return inBitSet;102 return bitSet; 103 103 } else if ( (bit < 0) || 104 (bit > inBitSet->n * 8 - 1) ) {104 (bit > bitSet->n * 8 - 1) ) { 105 105 psError(PS_ERR_BAD_PARAMETER_VALUE, true, 106 106 PS_ERRORTEXT_psBitSet_BIT_OUTOFRANGE, 107 bit, inBitSet->n * 8 - 1);108 return inBitSet;107 bit,bitSet->n * 8 - 1); 108 return bitSet; 109 109 } 110 110 // Variable byte is the byte in the array that contains the bit to be set 111 byte = inBitSet->bits + bit / 8;111 byte = bitSet->bits + bit / 8; 112 112 *byte |= mask(bit); 113 113 114 return inBitSet;115 } 116 117 psBitSet* psBitSetClear(psBitSet* inBitSet,118 psS32bit)114 return bitSet; 115 } 116 117 psBitSet* psBitSetClear(psBitSet* bitSet, 118 long bit) 119 119 { 120 120 char *byte = NULL; 121 121 122 if ( inBitSet == NULL) {122 if (bitSet == NULL) { 123 123 psError(PS_ERR_BAD_PARAMETER_NULL, true, 124 124 PS_ERRORTEXT_psBitSet_SET_NULL); 125 return inBitSet;125 return bitSet; 126 126 } else if ( (bit < 0) || 127 (bit > inBitSet->n * 8 - 1) ) {127 (bit > bitSet->n * 8 - 1) ) { 128 128 psError(PS_ERR_BAD_PARAMETER_VALUE, true, 129 129 PS_ERRORTEXT_psBitSet_BIT_OUTOFRANGE, 130 bit, inBitSet->n * 8 - 1);131 return inBitSet;130 bit,bitSet->n * 8 - 1); 131 return bitSet; 132 132 } 133 133 // Variable byte is the byte in the array that contains the bit to be set 134 byte = inBitSet->bits + bit / 8;134 byte = bitSet->bits + bit / 8; 135 135 *byte &= ! mask(bit); 136 136 137 return inBitSet;138 } 139 140 psBool psBitSetTest(const psBitSet* inBitSet,141 psS32bit)137 return bitSet; 138 } 139 140 bool psBitSetTest(const psBitSet* bitSet, 141 long bit) 142 142 { 143 143 char *byte = NULL; 144 144 145 if ( inBitSet == NULL) {145 if (bitSet == NULL) { 146 146 psError(PS_ERR_BAD_PARAMETER_NULL, true, 147 147 PS_ERRORTEXT_psBitSet_SET_NULL); 148 148 return false; 149 149 } else if ( (bit < 0) || 150 (bit > inBitSet->n * 8 - 1) ) {150 (bit > bitSet->n * 8 - 1) ) { 151 151 psError(PS_ERR_BAD_PARAMETER_VALUE, true, 152 152 PS_ERRORTEXT_psBitSet_BIT_OUTOFRANGE, 153 bit, inBitSet->n * 8 - 1);153 bit,bitSet->n * 8 - 1); 154 154 return false; 155 155 } 156 156 157 157 // Variable byte is the byte in the array that contains the bit to be tested 158 byte = inBitSet->bits + bit / 8;158 byte = bitSet->bits + bit / 8; 159 159 return ((*byte & mask(bit)) != 0); 160 160 } … … 162 162 psBitSet* psBitSetOp(psBitSet* outBitSet, 163 163 const psBitSet* inBitSet1, 164 c har *operator,164 const char *operator, 165 165 const psBitSet* inBitSet2) 166 166 { -
trunk/psLib/src/types/psBitSet.h
r4162 r4312 12 12 * @author Ross Harman, MHPCC 13 13 * 14 * @version $Revision: 1.1 8$ $Name: not supported by cvs2svn $15 * @date $Date: 2005-06- 08 23:40:45$14 * @version $Revision: 1.19 $ $Name: not supported by cvs2svn $ 15 * @date $Date: 2005-06-18 00:53:32 $ 16 16 * 17 17 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 56 56 /*@null@*/ 57 57 psBitSet* psBitSetAlloc( 58 psS32 n///< Number of bits in psBitSet array58 long nalloc ///< Number of bits in psBitSet array 59 59 ); 60 60 … … 69 69 psBitSet* psBitSetSet( 70 70 /* @returned@ */ 71 psBitSet* inMask, ///< Pointer to psBitSet to be set.72 psS32bit ///< Bit to be set.71 psBitSet* bitSet, ///< Pointer to psBitSet to be set. 72 long bit ///< Bit to be set. 73 73 ); 74 74 … … 83 83 psBitSet* psBitSetClear( 84 84 /* @returned@ */ 85 psBitSet* inMask, ///< Pointer to psBitSet to be cleared.86 psS32 bit///< Bit to be cleared.85 psBitSet* bitSet, ///< Pointer to psBitSet to be cleared. 86 long bit ///< Bit to be cleared. 87 87 ); 88 88 … … 97 97 */ 98 98 99 psBool psBitSetTest(100 const psBitSet* inMask, ///< Pointer psBitSet to be tested.101 psS32 bit///< Bit to be tested.99 bool psBitSetTest( 100 const psBitSet* bitSet, ///< Pointer psBitSet to be tested. 101 long bit ///< Bit to be tested. 102 102 ); 103 103 … … 111 111 psBitSet* psBitSetOp( 112 112 /* @returned@ */ 113 psBitSet* out Mask, ///< Resulting psBitSet from binary operation114 const psBitSet* in Mask1, ///< First psBitSet on which to operate115 c har *operator, ///< Bit operation116 const psBitSet* in Mask2 ///< First psBitSet on which to operate113 psBitSet* outBitSet, ///< Resulting psBitSet from binary operation 114 const psBitSet* inBitSet1, ///< First psBitSet on which to operate 115 const char *operator, ///< Bit operation 116 const psBitSet* inBitSet2 ///< First psBitSet on which to operate 117 117 ); 118 118 -
trunk/psLib/src/types/psList.c
r3682 r4312 6 6 * @author Robert Daniel DeSonia, MHPCC 7 7 * 8 * @version $Revision: 1.3 5$ $Name: not supported by cvs2svn $9 * @date $Date: 2005-0 4-07 20:27:41$8 * @version $Revision: 1.36 $ $Name: not supported by cvs2svn $ 9 * @date $Date: 2005-06-18 00:53:32 $ 10 10 * 11 11 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 592 592 } 593 593 594 psList* psArrayToList( psArray* arr)594 psList* psArrayToList(const psArray* array) 595 595 { 596 596 psU32 n; 597 597 psList* list; // list of elements 598 598 599 if (arr == NULL) {599 if (array == NULL) { 600 600 return NULL; 601 601 } 602 602 603 603 list = psListAlloc(NULL); 604 n = arr ->n;604 n = array->n; 605 605 for (psS32 i = 0; i < n; i++) { 606 psListAdd(list, PS_LIST_TAIL, arr ->data[i]);606 psListAdd(list, PS_LIST_TAIL, array->data[i]); 607 607 } 608 608 -
trunk/psLib/src/types/psList.h
r4162 r4312 7 7 * @ingroup LinkedList 8 8 * 9 * @version $Revision: 1.2 4$ $Name: not supported by cvs2svn $10 * @date $Date: 2005-06- 08 23:40:45$9 * @version $Revision: 1.25 $ $Name: not supported by cvs2svn $ 10 * @date $Date: 2005-06-18 00:53:32 $ 11 11 * 12 12 * Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii … … 205 205 */ 206 206 psList* psArrayToList( 207 psArray* arr///< vector to convert207 const psArray* array ///< vector to convert 208 208 ); 209 209
Note:
See TracChangeset
for help on using the changeset viewer.
