433 |
|
i = dp->dim[0].ne - 2; |
434 |
|
} else { /* unevenly spaced points */ |
435 |
|
int lower, upper; |
436 |
< |
if (dp->dim[0].siz > 0.0) { |
436 |
> |
if (dp->dim[0].siz > 0.) { |
437 |
|
lower = 0; |
438 |
|
upper = dp->dim[0].ne; |
439 |
|
} else { |
482 |
|
double f; |
483 |
|
sd.arr.s = dp->arr.s + i*stride; |
484 |
|
if ((sd.arr.s[sd.dim[0].ne] > 0) & ((-FTINY>c0)|(c0>FTINY))) { |
485 |
< |
f = c0*ldexp(1., (int)sd.arr.s[sd.dim[0].ne]-(COLXS+8)); |
485 |
> |
f = ldexp(c0, (int)sd.arr.s[sd.dim[0].ne]-(COLXS+8)); |
486 |
|
for (i = sd.dim[0].ne; i--; ) |
487 |
< |
rvec[i] += f*(sd.arr.s[i] + 0.5); |
487 |
> |
rvec[i] += f*(sd.arr.s[i] + .5); |
488 |
|
} |
489 |
|
sd.arr.s += stride; |
490 |
|
if ((sd.arr.s[sd.dim[0].ne] > 0) & ((-FTINY>c1)|(c1>FTINY))) { |
491 |
< |
f = c1*ldexp(1., (int)sd.arr.s[sd.dim[0].ne]-(COLXS+8)); |
491 |
> |
f = ldexp(c1, (int)sd.arr.s[sd.dim[0].ne]-(COLXS+8)); |
492 |
|
for (i = sd.dim[0].ne; i--; ) |
493 |
< |
rvec[i] += f*(sd.arr.s[i] + 0.5); |
493 |
> |
rvec[i] += f*(sd.arr.s[i] + .5); |
494 |
|
} |
495 |
|
} else { |
496 |
|
sd.arr.c = dp->arr.c + i*stride; |
529 |
|
y0 = f*(dp->arr.s[i] + 0.5); |
530 |
|
y1 = f*(dp->arr.s[i+1] + 0.5); |
531 |
|
} else |
532 |
< |
y0 = y1 = 0.0; |
532 |
> |
y0 = y1 = 0.; |
533 |
|
} else { |
534 |
|
y0 = colrval(dp->arr.c[i],dp->type); |
535 |
|
y1 = colrval(dp->arr.c[i+1],dp->type); |