Changeset 5090 for trunk/psLib/test/math
- Timestamp:
- Sep 21, 2005, 4:47:16 PM (21 years ago)
- Location:
- trunk/psLib/test/math
- Files:
-
- 11 edited
-
tst_psFunc00.c (modified) (10 diffs)
-
tst_psFunc08.c (modified) (4 diffs)
-
tst_psFunc09.c (modified) (7 diffs)
-
tst_psFunc10.c (modified) (7 diffs)
-
tst_psFunc11.c (modified) (7 diffs)
-
tst_psMinimize04.c (modified) (1 diff)
-
tst_psMinimize04_F32.c (modified) (3 diffs)
-
tst_psMinimize04b.c (modified) (3 diffs)
-
tst_psMinimize04b_F32.c (modified) (3 diffs)
-
tst_psMinimizeVector2D_F32.c (modified) (1 diff)
-
tst_psMinimizeVector2D_F64.c (modified) (1 diff)
Legend:
- Unmodified
- Added
- Removed
-
trunk/psLib/test/math/tst_psFunc00.c
r4731 r5090 14 14 * orders are created. 15 15 * 16 * @version $Revision: 1. 3$ $Name: not supported by cvs2svn $17 * @date $Date: 2005-0 8-08 21:44:09$16 * @version $Revision: 1.4 $ $Name: not supported by cvs2svn $ 17 * @date $Date: 2005-09-22 02:47:16 $ 18 18 * 19 19 * Copyright 2004-2005 Maui High Performance Computing Center, Univ. of Hawaii … … 63 63 } 64 64 // Verify polynomial structure members set properly 65 if(my1DPoly-> n != ORDER) {66 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 67 my1DPoly-> n, ORDER);65 if(my1DPoly->COOL_1D_n != ORDER) { 66 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 67 my1DPoly->COOL_1D_n, ORDER); 68 68 return 2; 69 69 } … … 73 73 return 3; 74 74 } 75 for(psS32 i = 0; i < ORDER ; i++) {75 for(psS32 i = 0; i < ORDER+1; i++) { 76 76 if(my1DPoly->coeff[i] != 0.0) { 77 77 psError(PS_ERR_UNKNOWN,true,"Coeff[%d] %lg not as expected %lg", … … 115 115 } 116 116 // Verify polynomial structure members set properly 117 if(my2DPoly-> nX != ORDER) {118 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 119 my2DPoly-> nX, ORDER);117 if(my2DPoly->COOL_2D_nX != ORDER) { 118 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 119 my2DPoly->COOL_2D_nX, ORDER); 120 120 return 2; 121 121 } 122 122 // Verify polynomial structure members set properly 123 if(my2DPoly-> nY != ORDER+1) {124 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 125 my2DPoly-> nY, ORDER+1);123 if(my2DPoly->COOL_2D_nY != ORDER+1) { 124 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 125 my2DPoly->COOL_2D_nY, ORDER+1); 126 126 return 3; 127 127 } … … 131 131 return 4; 132 132 } 133 for(psS32 i = 0; i < ORDER ; i++) {134 for(psS32 j = 0; j < ORDER+ 1; j++) {133 for(psS32 i = 0; i < ORDER+1; i++) { 134 for(psS32 j = 0; j < ORDER+2; j++) { 135 135 if(my2DPoly->coeff[i][j] != 0.0) { 136 136 psError(PS_ERR_UNKNOWN,true,"Coeff[%d][%d] %lg not as expected %lg", … … 181 181 } 182 182 // Verify polynomial structure members set properly 183 if(my3DPoly-> nX != ORDER) {184 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 185 my3DPoly-> nX, ORDER);183 if(my3DPoly->COOL_3D_nX != ORDER) { 184 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 185 my3DPoly->COOL_3D_nX, ORDER); 186 186 return 2; 187 187 } 188 188 // Verify polynomial structure members set properly 189 if(my3DPoly-> nY != ORDER+1) {190 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 191 my3DPoly-> nY, ORDER+1);189 if(my3DPoly->COOL_3D_nY != ORDER+1) { 190 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 191 my3DPoly->COOL_3D_nY, ORDER+1); 192 192 return 3; 193 193 } 194 194 // Verify polynomial structure members set properly 195 if(my3DPoly-> nZ != ORDER+2) {196 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 197 my3DPoly-> nZ, ORDER+2);195 if(my3DPoly->COOL_3D_nZ != ORDER+2) { 196 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 197 my3DPoly->COOL_3D_nZ, ORDER+2); 198 198 return 4; 199 199 } … … 203 203 return 5; 204 204 } 205 for(psS32 i = 0; i < ORDER ; i++) {206 for(psS32 j = 0; j < ORDER+ 1; j++) {207 for(psS32 k = 0; k < ORDER+ 2; k++) {205 for(psS32 i = 0; i < ORDER+1; i++) { 206 for(psS32 j = 0; j < ORDER+2; j++) { 207 for(psS32 k = 0; k < ORDER+3; k++) { 208 208 if(my3DPoly->coeff[i][j][k] != 0.0) { 209 209 psError(PS_ERR_UNKNOWN,true,"Coeff[%d][%d][%d] %lg not as expected %lg", … … 254 254 255 255 // Allocate polynomial 256 my4DPoly = psPolynomial4DAlloc(ORDER +3,ORDER,ORDER+1,ORDER+2,PS_POLYNOMIAL_ORD);256 my4DPoly = psPolynomial4DAlloc(ORDER,ORDER+1,ORDER+2,ORDER+3,PS_POLYNOMIAL_ORD); 257 257 // Verify structure allocated 258 258 if(my4DPoly == NULL) { … … 261 261 } 262 262 // Verify polynomial structure members set properly 263 if(my4DPoly-> nY!= ORDER) {264 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 265 my4DPoly-> nY, ORDER);263 if(my4DPoly->COOL_4D_nX != ORDER) { 264 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 265 my4DPoly->COOL_4D_nX, ORDER); 266 266 return 2; 267 267 } 268 268 // Verify polynomial structure members set properly 269 if(my4DPoly-> nZ!= ORDER+1) {270 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 271 my4DPoly-> nZ, ORDER+1);269 if(my4DPoly->COOL_4D_nY != ORDER+1) { 270 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 271 my4DPoly->COOL_4D_nX, ORDER+1); 272 272 return 3; 273 273 } 274 274 // Verify polynomial structure members set properly 275 if(my4DPoly-> nT!= ORDER+2) {276 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 277 my4DPoly-> nT, ORDER+2);275 if(my4DPoly->COOL_4D_nZ != ORDER+2) { 276 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 277 my4DPoly->COOL_4D_nZ, ORDER+2); 278 278 return 4; 279 279 } 280 280 // Verify polynomial structure members set properly 281 if(my4DPoly-> nX!= ORDER+3) {282 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 283 my4DPoly-> nX, ORDER+3);281 if(my4DPoly->COOL_4D_nT != ORDER+3) { 282 psError(PS_ERR_UNKNOWN,true,"Number of terms %d not as expected %d", 283 my4DPoly->COOL_4D_nT, ORDER+3); 284 284 return 5; 285 285 } … … 289 289 return 6; 290 290 } 291 for(psS32 i = 0; i < ORDER+ 3; i++) {292 for(psS32 j = 0; j < ORDER ; j++) {293 for(psS32 k = 0; k < ORDER+ 1; k++) {294 for(psS32 l = 0; l < ORDER+ 2; l++) {291 for(psS32 i = 0; i < ORDER+1; i++) { 292 for(psS32 j = 0; j < ORDER+2; j++) { 293 for(psS32 k = 0; k < ORDER+3; k++) { 294 for(psS32 l = 0; l < ORDER+4; l++) { 295 295 if(my4DPoly->coeff[i][j][k][l] != 0.0) { 296 296 psError(PS_ERR_UNKNOWN,true,"Coeff[%d][%d][%d][%d] %lg not as expected %lg", -
trunk/psLib/test/math/tst_psFunc08.c
r4731 r5090 4 4 * ORD and CHEB type polynomials. 5 5 * 6 * @version $Revision: 1. 3$ $Name: not supported by cvs2svn $7 * @date $Date: 2005-0 8-08 21:44:09$6 * @version $Revision: 1.4 $ $Name: not supported by cvs2svn $ 7 * @date $Date: 2005-09-22 02:47:16 $ 8 8 * 9 9 * XXX: Probably should test single- and multi-dimensional polynomials in … … 59 59 60 60 // Allocate polynomial structure 61 psPolynomial1D* polyOrd = psPolynomial1DAlloc(TERMS , PS_POLYNOMIAL_ORD);62 psPolynomial1D* polyCheb = psPolynomial1DAlloc(TERMS , PS_POLYNOMIAL_CHEB);61 psPolynomial1D* polyOrd = psPolynomial1DAlloc(TERMS-1, PS_POLYNOMIAL_ORD); 62 psPolynomial1D* polyCheb = psPolynomial1DAlloc(TERMS-1, PS_POLYNOMIAL_CHEB); 63 63 // Set polynomial members 64 64 for(psS32 i = 0; i < TERMS; i++) { … … 87 87 88 88 // Allocate polynomial with invalid type 89 polyOrd = psPolynomial1DAlloc(TERMS , 99);89 polyOrd = psPolynomial1DAlloc(TERMS-1, 99); 90 90 // Attempt to evaluation invalid polynomial type 91 91 psLogMsg(__func__,PS_LOG_INFO,"Following should generate error message invalid type"); … … 104 104 { 105 105 // Allocate polynomial 106 psPolynomial1D* polyOrd = psPolynomial1DAlloc(TERMS ,PS_POLYNOMIAL_ORD);107 psPolynomial1D* polyCheb = psPolynomial1DAlloc(TERMS ,PS_POLYNOMIAL_CHEB);106 psPolynomial1D* polyOrd = psPolynomial1DAlloc(TERMS-1,PS_POLYNOMIAL_ORD); 107 psPolynomial1D* polyCheb = psPolynomial1DAlloc(TERMS-1,PS_POLYNOMIAL_CHEB); 108 108 109 109 // Set polynomial members -
trunk/psLib/test/math/tst_psFunc09.c
r4731 r5090 4 4 * ORD and CHEB type polynomials. 5 5 * 6 * @version $Revision: 1. 3$ $Name: not supported by cvs2svn $7 * @date $Date: 2005-0 8-08 21:44:09$6 * @version $Revision: 1.4 $ $Name: not supported by cvs2svn $ 7 * @date $Date: 2005-09-22 02:47:16 $ 8 8 * 9 9 * Copyright 2004-2005 Maui High Performance Computing Center, Univ. of Hawaii … … 88 88 89 89 // Allocate polynomial structure 90 psPolynomial2D* polyOrd = psPolynomial2DAlloc(TERMS , TERMS, PS_POLYNOMIAL_ORD);91 psPolynomial2D* polyCheb = psPolynomial2DAlloc(TERMS , TERMS, PS_POLYNOMIAL_CHEB);90 psPolynomial2D* polyOrd = psPolynomial2DAlloc(TERMS-1, TERMS-1, PS_POLYNOMIAL_ORD); 91 psPolynomial2D* polyCheb = psPolynomial2DAlloc(TERMS-1, TERMS-1, PS_POLYNOMIAL_CHEB); 92 92 // Set polynomial members 93 93 for(psS32 i = 0; i < TERMS; i++) { … … 118 118 119 119 // Allocate polynomial with invalid type 120 polyOrd = psPolynomial2DAlloc(TERMS , TERMS, 99);120 polyOrd = psPolynomial2DAlloc(TERMS-1, TERMS-1, 99); 121 121 // Attempt to evaluation invalid polynomial type 122 122 psLogMsg(__func__,PS_LOG_INFO,"Following should generate error message invalid type"); … … 138 138 139 139 // Allocate polynomial structure 140 psPolynomial2D* polyOrd = psPolynomial2DAlloc(TERMS , TERMS, PS_POLYNOMIAL_ORD);141 psPolynomial2D* polyCheb = psPolynomial2DAlloc(TERMS , TERMS, PS_POLYNOMIAL_CHEB);140 psPolynomial2D* polyOrd = psPolynomial2DAlloc(TERMS-1, TERMS-1, PS_POLYNOMIAL_ORD); 141 psPolynomial2D* polyCheb = psPolynomial2DAlloc(TERMS-1, TERMS-1, PS_POLYNOMIAL_CHEB); 142 142 // Set polynomial members 143 143 for(psS32 i = 0; i < TERMS; i++) { … … 168 168 169 169 // Allocate polynomial with invalid type 170 polyOrd = psPolynomial2DAlloc(TERMS , TERMS, 99);170 polyOrd = psPolynomial2DAlloc(TERMS-1, TERMS-1, 99); 171 171 // Attempt to evaluation invalid polynomial type 172 172 psLogMsg(__func__,PS_LOG_INFO,"Following should generate error message invalid type"); … … 184 184 { 185 185 // Allocate polynomial 186 psPolynomial2D* polyOrd = psPolynomial2DAlloc(TERMS ,TERMS,PS_POLYNOMIAL_ORD);187 psPolynomial2D* polyCheb = psPolynomial2DAlloc(TERMS ,TERMS,PS_POLYNOMIAL_CHEB);186 psPolynomial2D* polyOrd = psPolynomial2DAlloc(TERMS-1,TERMS-1,PS_POLYNOMIAL_ORD); 187 psPolynomial2D* polyCheb = psPolynomial2DAlloc(TERMS-1,TERMS-1,PS_POLYNOMIAL_CHEB); 188 188 189 189 // Set polynomial members … … 297 297 { 298 298 // Allocate polynomial 299 psPolynomial2D* polyOrd = psPolynomial2DAlloc(TERMS ,TERMS,PS_POLYNOMIAL_ORD);300 psPolynomial2D* polyCheb = psPolynomial2DAlloc(TERMS ,TERMS,PS_POLYNOMIAL_CHEB);299 psPolynomial2D* polyOrd = psPolynomial2DAlloc(TERMS-1,TERMS-1,PS_POLYNOMIAL_ORD); 300 psPolynomial2D* polyCheb = psPolynomial2DAlloc(TERMS-1,TERMS-1,PS_POLYNOMIAL_CHEB); 301 301 302 302 // Set polynomial members -
trunk/psLib/test/math/tst_psFunc10.c
r4731 r5090 4 4 * ORD and CHEB type polynomials. 5 5 * 6 * @version $Revision: 1. 3$ $Name: not supported by cvs2svn $7 * @date $Date: 2005-0 8-08 21:44:09$6 * @version $Revision: 1.4 $ $Name: not supported by cvs2svn $ 7 * @date $Date: 2005-09-22 02:47:16 $ 8 8 * 9 9 * Copyright 2004-2005 Maui High Performance Computing Center, Univ. of Hawaii … … 139 139 140 140 // Allocate polynomial structure 141 psPolynomial3D* polyOrd = psPolynomial3DAlloc(TERMS , TERMS, TERMS, PS_POLYNOMIAL_ORD);142 psPolynomial3D* polyCheb = psPolynomial3DAlloc(TERMS , TERMS, TERMS, PS_POLYNOMIAL_CHEB);141 psPolynomial3D* polyOrd = psPolynomial3DAlloc(TERMS-1, TERMS-1, TERMS-1, PS_POLYNOMIAL_ORD); 142 psPolynomial3D* polyCheb = psPolynomial3DAlloc(TERMS-1, TERMS-1, TERMS-1, PS_POLYNOMIAL_CHEB); 143 143 // Set polynomial members 144 144 for(psS32 i = 0; i < TERMS; i++) { … … 173 173 174 174 // Allocate polynomial with invalid type 175 polyOrd = psPolynomial3DAlloc(TERMS , TERMS, TERMS, 99);175 polyOrd = psPolynomial3DAlloc(TERMS-1, TERMS-1, TERMS-1, 99); 176 176 // Attempt to evaluation invalid polynomial type 177 177 psLogMsg(__func__,PS_LOG_INFO,"Following should generate error message invalid type"); … … 193 193 194 194 // Allocate polynomial structure 195 psPolynomial3D* polyOrd = psPolynomial3DAlloc(TERMS ,TERMS,TERMS,PS_POLYNOMIAL_ORD);196 psPolynomial3D* polyCheb = psPolynomial3DAlloc(TERMS ,TERMS,TERMS,PS_POLYNOMIAL_CHEB);195 psPolynomial3D* polyOrd = psPolynomial3DAlloc(TERMS-1, TERMS-1, TERMS-1,PS_POLYNOMIAL_ORD); 196 psPolynomial3D* polyCheb = psPolynomial3DAlloc(TERMS-1, TERMS-1, TERMS-1,PS_POLYNOMIAL_CHEB); 197 197 // Set polynomial members 198 198 for(psS32 i = 0; i < TERMS; i++) { … … 227 227 228 228 // Allocate polynomial with invalid type 229 polyOrd = psPolynomial3DAlloc(TERMS , TERMS, TERMS, 99);229 polyOrd = psPolynomial3DAlloc(TERMS-1, TERMS-1, TERMS-1, 99); 230 230 // Attempt to evaluation invalid polynomial type 231 231 psLogMsg(__func__,PS_LOG_INFO,"Following should generate error message invalid type"); … … 243 243 { 244 244 // Allocate polynomial 245 psPolynomial3D* polyOrd = psPolynomial3DAlloc(TERMS ,TERMS,TERMS,PS_POLYNOMIAL_ORD);246 psPolynomial3D* polyCheb = psPolynomial3DAlloc(TERMS ,TERMS,TERMS,PS_POLYNOMIAL_CHEB);245 psPolynomial3D* polyOrd = psPolynomial3DAlloc(TERMS-1, TERMS-1, TERMS-1,PS_POLYNOMIAL_ORD); 246 psPolynomial3D* polyCheb = psPolynomial3DAlloc(TERMS-1, TERMS-1, TERMS-1,PS_POLYNOMIAL_CHEB); 247 247 248 248 // Set polynomial members … … 378 378 { 379 379 // Allocate polynomial 380 psPolynomial3D* polyOrd = psPolynomial3DAlloc(TERMS ,TERMS,TERMS,PS_POLYNOMIAL_ORD);381 psPolynomial3D* polyCheb = psPolynomial3DAlloc(TERMS ,TERMS,TERMS,PS_POLYNOMIAL_CHEB);380 psPolynomial3D* polyOrd = psPolynomial3DAlloc(TERMS-1, TERMS-1, TERMS-1,PS_POLYNOMIAL_ORD); 381 psPolynomial3D* polyCheb = psPolynomial3DAlloc(TERMS-1, TERMS-1, TERMS-1,PS_POLYNOMIAL_CHEB); 382 382 383 383 // Set polynomial members -
trunk/psLib/test/math/tst_psFunc11.c
r4731 r5090 4 4 * ORD and CHEB type polynomials. 5 5 * 6 * @version $Revision: 1. 3$ $Name: not supported by cvs2svn $7 * @date $Date: 2005-0 8-08 21:44:09$6 * @version $Revision: 1.4 $ $Name: not supported by cvs2svn $ 7 * @date $Date: 2005-09-22 02:47:16 $ 8 8 * 9 9 * Copyright 2004-2005 Maui High Performance Computing Center, Univ. of Hawaii … … 381 381 382 382 // Allocate polynomial structure 383 psPolynomial4D* polyOrd = psPolynomial4DAlloc(TERMS ,TERMS,TERMS,TERMS,PS_POLYNOMIAL_ORD);384 psPolynomial4D* polyCheb = psPolynomial4DAlloc(TERMS ,TERMS,TERMS,TERMS,PS_POLYNOMIAL_CHEB);383 psPolynomial4D* polyOrd = psPolynomial4DAlloc(TERMS-1, TERMS-1, TERMS-1, TERMS-1, PS_POLYNOMIAL_ORD); 384 psPolynomial4D* polyCheb = psPolynomial4DAlloc(TERMS-1, TERMS-1, TERMS-1, TERMS-1, PS_POLYNOMIAL_CHEB); 385 385 // Set polynomial members 386 386 for(psS32 i = 0; i < TERMS; i++) { … … 417 417 418 418 // Allocate polynomial with invalid type 419 polyOrd = psPolynomial4DAlloc(TERMS , TERMS, TERMS, TERMS, 99);419 polyOrd = psPolynomial4DAlloc(TERMS-1, TERMS-1, TERMS-1, TERMS-1, 99); 420 420 // Attempt to evaluation invalid polynomial type 421 421 psLogMsg(__func__,PS_LOG_INFO,"Following should generate error message invalid type"); … … 437 437 438 438 // Allocate polynomial structure 439 psPolynomial4D* polyOrd = psPolynomial4DAlloc(TERMS ,TERMS,TERMS,TERMS,PS_POLYNOMIAL_ORD);440 psPolynomial4D* polyCheb = psPolynomial4DAlloc(TERMS ,TERMS,TERMS,TERMS,PS_POLYNOMIAL_CHEB);439 psPolynomial4D* polyOrd = psPolynomial4DAlloc(TERMS-1, TERMS-1, TERMS-1, TERMS-1, PS_POLYNOMIAL_ORD); 440 psPolynomial4D* polyCheb = psPolynomial4DAlloc(TERMS-1, TERMS-1, TERMS-1, TERMS-1, PS_POLYNOMIAL_CHEB); 441 441 // Set polynomial members 442 442 for(psS32 i = 0; i < TERMS; i++) { … … 473 473 474 474 // Allocate polynomial with invalid type 475 polyOrd = psPolynomial4DAlloc(TERMS , TERMS, TERMS, TERMS, 99);475 polyOrd = psPolynomial4DAlloc(TERMS-1, TERMS-1, TERMS-1, TERMS-1, 99); 476 476 // Attempt to evaluation invalid polynomial type 477 477 psLogMsg(__func__,PS_LOG_INFO,"Following should generate error message invalid type"); … … 489 489 { 490 490 // Allocate polynomial 491 psPolynomial4D* polyOrd = psPolynomial4DAlloc(TERMS ,TERMS,TERMS,TERMS,PS_POLYNOMIAL_ORD);492 psPolynomial4D* polyCheb = psPolynomial4DAlloc(TERMS ,TERMS,TERMS,TERMS,PS_POLYNOMIAL_CHEB);491 psPolynomial4D* polyOrd = psPolynomial4DAlloc(TERMS-1, TERMS-1, TERMS-1, TERMS-1, PS_POLYNOMIAL_ORD); 492 psPolynomial4D* polyCheb = psPolynomial4DAlloc(TERMS-1, TERMS-1, TERMS-1, TERMS-1, PS_POLYNOMIAL_CHEB); 493 493 494 494 // Set polynomial members … … 646 646 { 647 647 // Allocate polynomial 648 psPolynomial4D* polyOrd = psPolynomial4DAlloc(TERMS ,TERMS,TERMS,TERMS,PS_POLYNOMIAL_ORD);649 psPolynomial4D* polyCheb = psPolynomial4DAlloc(TERMS ,TERMS,TERMS,TERMS,PS_POLYNOMIAL_CHEB);648 psPolynomial4D* polyOrd = psPolynomial4DAlloc(TERMS-1, TERMS-1, TERMS-1, TERMS-1, PS_POLYNOMIAL_ORD); 649 psPolynomial4D* polyCheb = psPolynomial4DAlloc(TERMS-1, TERMS-1, TERMS-1, TERMS-1, PS_POLYNOMIAL_CHEB); 650 650 651 651 // Set polynomial members -
trunk/psLib/test/math/tst_psMinimize04.c
r4995 r5090 45 45 double actualData; 46 46 47 psPolynomial2D *myPoly = psPolynomial2DAlloc(POLY_ORDER +1, POLY_ORDER+1, PS_POLYNOMIAL_ORD);47 psPolynomial2D *myPoly = psPolynomial2DAlloc(POLY_ORDER, POLY_ORDER, PS_POLYNOMIAL_ORD); 48 48 psVector *x = psVectorAlloc(NUM_DATA, PS_TYPE_F32); 49 49 psVector *y = psVectorAlloc(NUM_DATA, PS_TYPE_F32); -
trunk/psLib/test/math/tst_psMinimize04_F32.c
r4995 r5090 45 45 float actualData; 46 46 47 myPoly = psPolynomial1DAlloc(POLY_ORDER +1, PS_POLYNOMIAL_ORD);47 myPoly = psPolynomial1DAlloc(POLY_ORDER, PS_POLYNOMIAL_ORD); 48 48 x = psVectorAlloc(NUM_DATA, PS_TYPE_F32); 49 49 y = psVectorAlloc(NUM_DATA, PS_TYPE_F32); … … 114 114 float actualData; 115 115 116 myPoly = psPolynomial1DAlloc(POLY_ORDER +1, PS_POLYNOMIAL_ORD);116 myPoly = psPolynomial1DAlloc(POLY_ORDER, PS_POLYNOMIAL_ORD); 117 117 x = psVectorAlloc(NUM_DATA, PS_TYPE_F32); 118 118 y = psVectorAlloc(NUM_DATA, PS_TYPE_F32); … … 179 179 float actualData; 180 180 181 myPoly = psPolynomial1DAlloc(POLY_ORDER +1, PS_POLYNOMIAL_ORD);181 myPoly = psPolynomial1DAlloc(POLY_ORDER, PS_POLYNOMIAL_ORD); 182 182 y = psVectorAlloc(NUM_DATA, PS_TYPE_F32); 183 183 -
trunk/psLib/test/math/tst_psMinimize04b.c
r4995 r5090 38 38 psS32 memLeaks = 0; 39 39 40 myPoly = psPolynomial1DAlloc(POLY_ORDER +1, PS_POLYNOMIAL_CHEB);40 myPoly = psPolynomial1DAlloc(POLY_ORDER, PS_POLYNOMIAL_CHEB); 41 41 x = psVectorAlloc(NUM_DATA, PS_TYPE_F64); 42 42 y = psVectorAlloc(NUM_DATA, PS_TYPE_F64); … … 109 109 psS32 memLeaks = 0; 110 110 111 myPoly = psPolynomial1DAlloc(POLY_ORDER +1, PS_POLYNOMIAL_CHEB);111 myPoly = psPolynomial1DAlloc(POLY_ORDER, PS_POLYNOMIAL_CHEB); 112 112 x = psVectorAlloc(NUM_DATA, PS_TYPE_F64); 113 113 y = psVectorAlloc(NUM_DATA, PS_TYPE_F64); … … 172 172 psS32 memLeaks = 0; 173 173 174 myPoly = psPolynomial1DAlloc(POLY_ORDER +1, PS_POLYNOMIAL_CHEB);174 myPoly = psPolynomial1DAlloc(POLY_ORDER, PS_POLYNOMIAL_CHEB); 175 175 x = psVectorAlloc(NUM_DATA, PS_TYPE_F64); 176 176 y = psVectorAlloc(NUM_DATA, PS_TYPE_F64); -
trunk/psLib/test/math/tst_psMinimize04b_F32.c
r4995 r5090 38 38 psS32 memLeaks = 0; 39 39 40 myPoly = psPolynomial1DAlloc(POLY_ORDER +1, PS_POLYNOMIAL_CHEB);40 myPoly = psPolynomial1DAlloc(POLY_ORDER, PS_POLYNOMIAL_CHEB); 41 41 x = psVectorAlloc(NUM_DATA, PS_TYPE_F32); 42 42 y = psVectorAlloc(NUM_DATA, PS_TYPE_F32); … … 109 109 psS32 memLeaks = 0; 110 110 111 myPoly = psPolynomial1DAlloc(POLY_ORDER +1, PS_POLYNOMIAL_CHEB);111 myPoly = psPolynomial1DAlloc(POLY_ORDER, PS_POLYNOMIAL_CHEB); 112 112 x = psVectorAlloc(NUM_DATA, PS_TYPE_F32); 113 113 y = psVectorAlloc(NUM_DATA, PS_TYPE_F32); … … 172 172 psS32 memLeaks = 0; 173 173 174 myPoly = psPolynomial1DAlloc(POLY_ORDER +1, PS_POLYNOMIAL_CHEB);174 myPoly = psPolynomial1DAlloc(POLY_ORDER, PS_POLYNOMIAL_CHEB); 175 175 x = psVectorAlloc(NUM_DATA, PS_TYPE_F32); 176 176 y = psVectorAlloc(NUM_DATA, PS_TYPE_F32); -
trunk/psLib/test/math/tst_psMinimizeVector2D_F32.c
r4995 r5090 45 45 double actualData; 46 46 47 psPolynomial2D *myPoly = psPolynomial2DAlloc(POLY_ORDER +1, POLY_ORDER+1, PS_POLYNOMIAL_ORD);47 psPolynomial2D *myPoly = psPolynomial2DAlloc(POLY_ORDER, POLY_ORDER, PS_POLYNOMIAL_ORD); 48 48 psVector *x = psVectorAlloc(NUM_DATA, PS_TYPE_F64); 49 49 psVector *y = psVectorAlloc(NUM_DATA, PS_TYPE_F64); -
trunk/psLib/test/math/tst_psMinimizeVector2D_F64.c
r4995 r5090 45 45 double actualData; 46 46 47 psPolynomial2D *myPoly = psPolynomial2DAlloc(POLY_ORDER +1, POLY_ORDER+1, PS_POLYNOMIAL_ORD);47 psPolynomial2D *myPoly = psPolynomial2DAlloc(POLY_ORDER, POLY_ORDER, PS_POLYNOMIAL_ORD); 48 48 psVector *x = psVectorAlloc(NUM_DATA, PS_TYPE_F32); 49 49 psVector *y = psVectorAlloc(NUM_DATA, PS_TYPE_F32);
Note:
See TracChangeset
for help on using the changeset viewer.
