1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414
|
;
; Initial author : P. Chanial 2006.01.17
; Code under GNU GPL V2 or later
;
; NOTA BENE : AC, 9 Feb. 2018 : unfinished modifs and extensions
; Some changes need in source code (basic_fun.cpp)
;
; ---------------------------------------
; Modifications history :
;
; - 2018-FEB-04 : AC. Corrected "bug" when cumulating large number
; of byte ... large rewriting, trying to automatic
; and to have numerical cases at the limits ...
;
; - 2020-JUN-03 : AC. Add a test to trigged bug report #775
;
; ---------------------------------------
; Script : regression-total
pro regression, a
;
; AC 2018 March : this part of the test should be recycle ... TODO !!!
;
print, 'Testing '+size(a, /tname)+':'
; help, total(a), total(a, /NaN), total(a, /cumul), total(a, /cumul, /NaN), output = output
; print, output
; help, total(a, /double), total(a, /NaN, /double), total(a, /cumul, /double), total(a, /cumul, /NaN, /double), output=output
; print, output
; help, total(a, 1), total(a, 1, /NaN), total(a, 1, /cumul), total(a, 1, /cumul, /NaN), output=output
; print, output
; help, total(a, 1, /double), total(a, 1, /NaN, /double), total(a, 1, /cumul, /double), total(a, 1, /cumul, /NaN, /double), output=output
; print, output
; help, total(a, 2), total(a, 2, /NaN), total(a, 2, /cumul), total(a, 2, /cumul, /NaN), output=output
; print, output
; help, total(a, 2, /double), total(a, 2, /NaN, /double), total(a, 2, /cumul, /double), total(a, 2, /cumul, /NaN, /double), output=output
; print, output
; help, total(a, 3), total(a, 3, /NaN), total(a, 3, /cumul), total(a, 3, /cumul, /NaN), output=output
; print, output
; help, total(a, 3, /double), total(a, 3, /NaN, /double), total(a, 3, /cumul, /double), total(a, 3, /cumul, /NaN, /double), output=output
; print, output
print, '-- 1' & print, total(a)
print, '-- 2' & print, total(a, /NaN)
print, '-- 3' & print, total(a, /cumul)
print, '-- 4' & print, total(a, /cumul, /NaN)
print, '-- 5' & print, total(a, /double)
print, '-- 6' & print, total(a, /NaN, /double)
print, '-- 7' & print, total(a, /cumul, /double)
print, '-- 8' & print, total(a, /cumul, /NaN, /double)
print, '==========================================='
print, '-- 9' & print, total(a, 1)
print, '-- 10' & print, total(a, 1, /NaN)
print, '-- 11' & print, total(a, 1, /cumul)
print, '-- 12' & print, total(a, 1, /cumul, /NaN)
print, '-- 13' & print, total(a, 1, /double)
print, '-- 14' & print, total(a, 1, /NaN, /double)
print, '-- 15' & print, total(a, 1, /cumul, /double)
print, '-- 16' & print, total(a, 1, /cumul, /NaN, /double)
print, '==========================================='
print, '-- 17' & print, total(a, 2)
print, '-- 18' & print, total(a, 2, /NaN)
print, '-- 19' & print, total(a, 2, /cumul)
print, '-- 20' & print, total(a, 2, /cumul, /NaN)
print, '-- 21' & print, total(a, 2, /double)
print, '-- 22' & print, total(a, 2, /NaN, /double)
print, '-- 23' & print, total(a, 2, /cumul, /double)
print, '-- 24' & print, total(a, 2, /cumul, /NaN, /double)
print, '==========================================='
print, '-- 25' & print, total(a, 3)
print, '-- 26' & print, total(a, 3, /NaN)
print, '-- 27' & print, total(a, 3, /cumul)
print, '-- 28' & print, total(a, 3, /cumul, /NaN)
print, '-- 29' & print, total(a, 3, /double)
print, '-- 30' & print, total(a, 3, /NaN, /double)
print, '-- 31' & print, total(a, 3, /cumul, /double)
print, '-- 32' & print, total(a, 3, /cumul, /NaN, /double)
end
pro TEST_TOTAL_NAN_INF, cumul_errors, test=test, verbose=verbose
;
print, 'AC 2018 March : this part of the test should be recycle ... TODO !!!'
;BANNER_FOR_TESTSUITE, pref='TEST_TOTAL_NAN_INF', 'unfinished !', 1000
; unfinished !
return
;; we need a way to know whether IDL or GDL is running...
DEFSYSV, '!gdl', exists=isGDL
;filename = (isGDL?'gdl':'idl'+strtrim(!version.release,1))+$
; '-test-total.txt'
;journal, filename
a = bytarr(3, 3, 3)+1b
regression, a
a = findgen(3, 3, 3)
a[0,0,0] = !values.f_nan
a[1,1,0] = !values.f_infinity
a[2,1,0] = -!values.f_infinity
a[0,2,1] = !values.f_nan
a[2,0,2] = !values.f_nan
regression, a
a = dindgen(3, 3, 3)
a[0,0,0] = !values.d_nan
a[0,1,1] = !values.d_infinity
a[2,0,1] = -!values.d_infinity
a[0,2,1] = !values.d_nan
a[2,2,2] = !values.d_nan
regression, a
a = complexarr(3, 3, 3)+1
a[0,0,0] = complex(3, !values.f_nan)
a[1,1,0] = complex(!values.f_nan, !values.f_infinity)
a[2,1,0] = complex(0, -!values.f_infinity)
a[0,2,1] = complex(78, !values.f_nan)
a[2,0,2] = complex(!values.f_infinity, 40)
regression, a
a = dcomplexarr(3, 3, 3)+1
a[0,0,0] = complex(3, !values.d_nan)
a[1,1,0] = complex(!values.d_nan, !values.d_infinity)
a[2,1,0] = complex(0, -!values.d_infinity)
a[0,2,1] = complex(78, !values.d_nan)
a[2,0,2] = complex(!values.d_infinity, 40)
regression, a
; journal
end
;
; -----------------------------------------------------------------
;
; related to bug report #775 on Github
pro TEST_TOTAL_DIM, cumul_errors, test=test, verbose=verbose, debug=debug
;
errors=0
;
GIVE_LIST_NUMERIC, liste_type
;
for ii=0, N_ELEMENTS(liste_type)-1 do begin
;;
tab=MAKE_ARRAY(2, 3, 4, 5, type=liste_type[ii], /index)
if KEYWORD_SET(verbose) then print, ' Running type :'+TYPENAME(tab)
;;
res0=TOTAL(TOTAL(tab, 2, /int))
if KEYWORD_SET(debug) then print, 'after res0'+TYPENAME(tab)
res1=TOTAL(TOTAL(tab, 2))
if KEYWORD_SET(debug) then print, 'after res1'+TYPENAME(tab)
res2=TOTAL(TOTAL(tab, 2, /double))
if KEYWORD_SET(debug) then print, 'after res2'+TYPENAME(tab)
;;
txt='for type '+TYPENAME(tab)
if res0 NE 7140 then ERRORS_ADD, errors, 'pb RES0 (/int) '+txt
if res1 NE 7140 then ERRORS_ADD, errors, 'pb RES1 (default) '+txt
if res2 NE 7140 then ERRORS_ADD, errors, 'pb RES2 (/double) '+txt
endfor
;
; --------------
;
BANNER_FOR_TESTSUITE, "TEST_TOTAL_DIM", errors, /short, verb=verbose
ERRORS_CUMUL, cumul_errors, errors
if KEYWORD_SET(test) then STOP
;
end
; -----------------------------------------------------------------
;
pro TEST_TOTAL_LARGE, cumul_errors, test=test, verbose=verbose
;
;BANNER_FOR_TESTSUITE, pref='TEST_TOTAL_LARGE', 'unfinished !', 1000
;return
;
errors=0
kk=1
for ii=0, 7 do begin
;;
internal=0
;;
kk=10L*kk
a=LINDGEN(kk)
res1=TOTAL([a,-a],/int)
res2=TOTAL([a,-a])
tmp=TOTAL([a,-a],/int,/cumul)
res3=tmp[-1] ; last value
tmp=TOTAL([a,-a],/cumul);,/dou)
res4=tmp[-1] ; last value
;;
if ~ARRAY_EQUAL(0ll, res1, /no_type) then $
ERRORS_ADD, internal, 'res 1, kk='+string(kk)
if ~ARRAY_EQUAL(0ll, res3, /no_type) then $
ERRORS_ADD, internal, 'res 3, kk='+string(kk)
if ~ARRAY_EQUAL(0., res2, /no_type) then $
ERRORS_ADD, internal, 'res 2, kk='+string(kk)
;; we cannot test on "res4", just to show the problem
if KEYWORD_SET(verbose) then print, kk, res1, res2, res3, res4
;;
ERRORS_CUMUL, errors, internal
;;
endfor
;
; https://sourceforge.net/p/gnudatalanguage/bugs/593/
; showing Float conversion tricks ...
; (computations are OK, print seems to be not OK if bad format)
;
res_f=17865335.
res_d=17865335d
res_l=17865335l
res_l64=17865335ll
;
a=[8926507,8938828,0]
if ~ARRAY_EQUAL(TOTAL(a), res_f, /no_type) then $
ERRORS_ADD, errors, 'case 3 Long to Float'
if ~ARRAY_EQUAL(TOTAL(a,/double), res_d, /no_type) then $
ERRORS_ADD, errors, 'case 3 Long to Double'
if ~ARRAY_EQUAL(TOTAL(a,/int), res_l64, /no_type) then $
ERRORS_ADD, errors, 'case 3 Long to /int Long64'
if ~ARRAY_EQUAL(TOTAL(a,/preserve), res_l, /no_type) then $
ERRORS_ADD, errors, 'case 3 Long to /pre Long'
;
; playing with big values in "special" type
;
grand=80000000ll
;
; res=grand*(grand-1)/2
;
res_f=3199999960000000.
res_d=3199999960000000.d
res_l64=3199999960000000
res_ul=216376832ul
if ~ARRAY_EQUAL(TOTAL(ULINDGEN(grand)), res_f, /no_type) then $
ERRORS_ADD, errors, 'case default in ULong'
if ~ARRAY_EQUAL(TOTAL(ULINDGEN(grand), /double), res_d, /no_type) then $
ERRORS_ADD, errors, 'case ULong Double'
if ~ARRAY_EQUAL(TOTAL(ULINDGEN(grand),/pres), res_ul, /no_type) then $
ERRORS_ADD, errors, 'case ULong ULong'
if ~ARRAY_EQUAL(TOTAL(ULINDGEN(grand),/int), res_l64, /no_type) then $
ERRORS_ADD, errors, 'case ULong Long64'
;
; cf mail @ Gilles
;
; --------------
;
BANNER_FOR_TESTSUITE, "TEST_TOTAL_LARGE", errors, /short, verb=verbose
ERRORS_CUMUL, cumul_errors, errors
if KEYWORD_SET(test) then STOP
;
end
;
pro TEST_TOTAL_INT, cumul_errors, test=test, verbose=verbose, debug=debug
;
offset=201b
nbps=0
;
dims=[3,4,5]
muldims=PRODUCT(dims, /integer)
in=BYTARR(dims)
in=in+offset
;
GIVE_LIST_NUMERIC, list_num_types, list_num_names, /integer
;
exp1f_ref=FLOAT(muldims)*FLOAT(offset)
exp1int_ref=muldims*LONG64(offset)
;
exp1intc = [$
[ [201.,402.,603.], [804.,1005.,1206.], [1407.,1608.,1809.], [2010.,2211.,2412.] ], $
[ [2613.,2814.,3015.], [3216.,3417.,3618.], [3819.,4020.,4221.], [4422.,4623.,4824.] ], $
[ [5025.,5226.,5427.], [5628.,5829.,6030.], [6231.,6432.,6633.], [6834.,7035.,7236.] ], $
[ [7437.,7638.,7839.], [8040.,8241.,8442.], [8643.,8844.,9045.], [9246.,9447.,9648.] ], $
[ [9849.,10050.,10251.], [10452.,10653.,10854.], [11055,11256,11457.], [11658.,11859.,12060.] ]$
]
;exp1intc = LON64ARR(dims)
exp1fc = FIX(exp1intc, type=FLOAT)
exp1intc = FIX(exp1intc, type=LONG64)
for ii=0, N_ELEMENTS(list_num_types)-1 do begin
;;
internal=nbps
;;
type=list_num_types[ii]
name=list_num_names[ii]
input=FIX(in, type=type)
exp1pres=FIX(exp1int_ref, type=type)
exp1presc=FIX(exp1intc, type=type)
res1f=TOTAL(input)
res1int=TOTAL(input,/int)
res1pres=TOTAL(input,/preserve)
res1fc=TOTAL(input,/cumulative)
res1intc=TOTAL(input,/int,/cumulative)
res1presc=TOTAL(input,/preserve,/cumulative)
exp1fc = FLOAT(exp1intc)
exp1intc = LONG64(exp1intc)
;;
;; few special cases
exp1f=exp1f_ref
exp1int=exp1int_ref
if type GE 14 then exp1f=DOUBLE(exp1f_ref)
if type EQ 15 then exp1int=ULONG64(exp1int_ref)
if type GE 14 then exp1fc=DOUBLE(exp1fc)
if type EQ 15 then exp1intc=ULONG64(exp1intc)
;;
if KEYWORD_SET(verbose) then begin
print, 'Exp: ', name, exp1f, exp1int, exp1pres
print, 'Res: ', name, res1f, res1int, res1pres
endif
if ~ARRAY_EQUAL(res1f, exp1f, /no_type) then $
ERRORS_ADD, nbps, 'res 1 F Type='+name
if ~ARRAY_EQUAL(res1int, exp1int, /no_type) then $
ERRORS_ADD, nbps, 'res 1 /Int Type='+name
if ~ARRAY_EQUAL(res1pres, exp1pres, /no_type) then $
ERRORS_ADD, nbps, 'res 1 /Pres Type='+name
if ~ARRAY_EQUAL(res1fc, exp1fc, /no_type) then $
ERRORS_ADD, nbps, 'res 1 /cumulative Type='+name
if ~ARRAY_EQUAL(res1intc, exp1intc, /no_type) then $
ERRORS_ADD, nbps, 'res 1 /int /cumulative Type='+name
if ~ARRAY_EQUAL(res1presc, exp1presc, /no_type) then $
ERRORS_ADD, nbps, 'res 1 /preserve /cumulative Type='+name
;;
if KEYWORD_SET(debug) then if nbps GT internal then stop
endfor
;
; ----- final ----
;
BANNER_FOR_TESTSUITE, 'TEST_TOTAL_INT', nbps, /short
ERRORS_CUMUL, cumul_errors, nbps
if KEYWORD_set(test) then STOP
;
end
;
pro TEST_TOTAL_COMPLEX, cumul_errors, test=test, verbose=verbose
nbps=0
r = [1,2,3]
i = [4,5,6]
c = COMPLEX(r, i)
tot = total(c, /cumulative)
BANNER_FOR_TESTSUITE, 'TEST_TOTAL_COMPLEX', nbps, /short
ERRORS_CUMUL, cumul_errors, nbps
if KEYWORD_set(test) then STOP
;
end
; -----------------------------------------------------------------
;
pro TEST_TOTAL, help=help, test=test, verbose=verbose, no_exit=no_exit
;
if KEYWORD_SET(help) then begin
print, 'pro TEST_TOTAL, help=help, test=test, verbose=verbose, no_exit=no_exit'
return
endif
;
cumul_errors=0
;
TEST_TOTAL_NAN_INF, cumul_errors, test=test, verbose=verbose
;
TEST_TOTAL_LARGE, cumul_errors, test=test, verbose=verbose
;
TEST_TOTAL_INT, cumul_errors, test=test, verbose=verbose
;
TEST_TOTAL_DIM, cumul_errors, test=test, verbose=verbose
;
; ----------------- final message ----------
;
BANNER_FOR_TESTSUITE, 'TEST_TOTAL', cumul_errors, short=short
;
if (cumul_errors GT 0) AND ~KEYWORD_SET(no_exit) then EXIT, status=1
;
if KEYWORD_SET(test) then STOP
;
end
; some tests:
;code=[1,2,3,4,5,12,13,14,15] & list_type = ["UNDEFINED","BYTE","INT","LONG","FLOAT","DOUBLE","COMPLEX","STRING","STRUCT","DCOMPLEX","POINTER","OBJREF","UINT","ULONG","LONG64","ULONG64"] & for i=0,n_elements(code)-1 do begin a=fix(lindgen(10LL^8),type=code[i]) & c=[a,-a] & tic & b=total(c,/pres) & toc & print,list_type[code[i]] & help,b[-1] & end
;% Time elapsed: 0.016649008 seconds.
;BYTE
;<Expression> BYTE = 0
;% Time elapsed: 0.019578934 seconds.
;INT
;<Expression> INT = 0
;% Time elapsed: 0.044885874 seconds.
;LONG
;<Expression> LONG = 0
;% Time elapsed: 0.037983894 seconds.
;FLOAT
;<Expression> FLOAT = 0.00000
;% Time elapsed: 0.074567080 seconds.
;DOUBLE
;<Expression> DOUBLE = 0.0000000
;% Time elapsed: 0.020087957 seconds.
;UINT
;<Expression> UINT = 0
;% Time elapsed: 0.039674997 seconds.
;ULONG
;<Expression> ULONG = 0
;% Time elapsed: 0.079846144 seconds.
;LONG64
;<Expression> LONG64 = 0
;% Time elapsed: 0.074343920 seconds.
;ULONG64
;<Expression> ULONG64 = 0
;IDL>
|