| 150 |
|
if (cp == fname) return; |
| 151 |
|
} |
| 152 |
|
if ((lp = liblookup(fname)) == NULL) { /* insert */ |
| 153 |
+ |
if (fptr == NULL) |
| 154 |
+ |
return; /* nothing! */ |
| 155 |
|
if (libsize >= MAXLIB) { |
| 156 |
|
eputs("Too many library functons!\n"); |
| 157 |
|
quit(1); |
| 392 |
|
static double |
| 393 |
|
l_select(char *nm) /* return argument #(A1+1) */ |
| 394 |
|
{ |
| 395 |
< |
int n; |
| 395 |
> |
int narg = nargum(); |
| 396 |
> |
double a1 = argument(1); |
| 397 |
> |
int n = (int)(a1 + .5); |
| 398 |
|
|
| 399 |
< |
n = (int)(argument(1) + .5); |
| 396 |
< |
if (n == 0) |
| 397 |
< |
return(nargum()-1); |
| 398 |
< |
if (n < 1 || n > nargum()-1) { |
| 399 |
> |
if (a1 < -.5 || n >= narg) { |
| 400 |
|
errno = EDOM; |
| 401 |
|
return(0.0); |
| 402 |
|
} |
| 403 |
+ |
if (!n) /* asking max index? */ |
| 404 |
+ |
return(narg-1); |
| 405 |
|
return(argument(n+1)); |
| 406 |
|
} |
| 407 |
|
|
| 410 |
|
l_max(char *nm) /* general maximum function */ |
| 411 |
|
{ |
| 412 |
|
int n = nargum(); |
| 413 |
< |
int i = 1; |
| 411 |
< |
int vmax = argument(1); |
| 413 |
> |
double vmax = argument(1); |
| 414 |
|
|
| 415 |
< |
while (i++ < n) { |
| 416 |
< |
double v = argument(i); |
| 415 |
> |
while (--n) { |
| 416 |
> |
double v = argument(n); |
| 417 |
|
if (vmax < v) |
| 418 |
|
vmax = v; |
| 419 |
|
} |
| 425 |
|
l_min(char *nm) /* general minimum function */ |
| 426 |
|
{ |
| 427 |
|
int n = nargum(); |
| 428 |
< |
int i = 1; |
| 427 |
< |
int vmin = argument(1); |
| 428 |
> |
double vmin = argument(1); |
| 429 |
|
|
| 430 |
< |
while (i++ < n) { |
| 431 |
< |
double v = argument(i); |
| 430 |
> |
while (--n) { |
| 431 |
> |
double v = argument(n); |
| 432 |
|
if (vmin > v) |
| 433 |
|
vmin = v; |
| 434 |
|
} |
