22 |
|
|
23 |
|
/* bits in argument flag (better be right!) */ |
24 |
|
#define AFLAGSIZ (8*sizeof(unsigned long)) |
25 |
< |
#define ALISTSIZ 8 /* maximum saved argument list */ |
25 |
> |
#define ALISTSIZ 10 /* maximum saved argument list */ |
26 |
|
|
27 |
|
typedef struct activation { |
28 |
|
char *name; /* function name */ |
71 |
|
{ "tan", 1, ':', l_tan }, |
72 |
|
}; |
73 |
|
|
74 |
< |
static int libsize = 16; |
74 |
> |
static int libsize = 18; |
75 |
|
|
76 |
|
#define resolve(ep) ((ep)->type==VAR?(ep)->v.ln:argf((ep)->v.chan)) |
77 |
|
|
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); |
203 |
|
EPNODE *ep = NULL; |
204 |
|
double aval; |
205 |
|
|
204 |
– |
if (!n) /* asking for # arguments? */ |
205 |
– |
return((double)nargum()); |
206 |
– |
|
206 |
|
if (!actp | (--n < 0)) { |
207 |
|
eputs("Bad call to argument!\n"); |
208 |
|
quit(1); |
355 |
|
errno = ERANGE; |
356 |
|
} |
357 |
|
#endif |
358 |
< |
if (errno == EDOM || errno == ERANGE) { |
358 |
> |
if ((errno == EDOM) | (errno == ERANGE)) { |
359 |
|
wputs(fname); |
360 |
|
if (errno == EDOM) |
361 |
|
wputs(": domain error\n"); |
389 |
|
static double |
390 |
|
l_select(char *nm) /* return argument #(A1+1) */ |
391 |
|
{ |
392 |
< |
int n; |
392 |
> |
int narg = nargum(); |
393 |
> |
double a1 = argument(1); |
394 |
> |
int n = (int)(a1 + .5); |
395 |
|
|
396 |
< |
n = (int)(argument(1) + .5); |
396 |
< |
if (n == 0) |
397 |
< |
return(nargum()-1); |
398 |
< |
if (n < 1 || n > nargum()-1) { |
396 |
> |
if ((a1 < -.5) | (n >= narg)) { |
397 |
|
errno = EDOM; |
398 |
|
return(0.0); |
399 |
|
} |
400 |
+ |
if (!n) /* asking max index? */ |
401 |
+ |
return(narg-1); |
402 |
|
return(argument(n+1)); |
403 |
|
} |
404 |
|
|
407 |
|
l_max(char *nm) /* general maximum function */ |
408 |
|
{ |
409 |
|
int n = nargum(); |
410 |
< |
int i = 1; |
411 |
< |
int vmax = argument(1); |
410 |
> |
double vmax = argument(1); |
411 |
|
|
412 |
< |
while (i++ < n) { |
413 |
< |
double v = argument(i); |
412 |
> |
while (n > 1) { |
413 |
> |
double v = argument(n--); |
414 |
|
if (vmax < v) |
415 |
|
vmax = v; |
416 |
|
} |
422 |
|
l_min(char *nm) /* general minimum function */ |
423 |
|
{ |
424 |
|
int n = nargum(); |
425 |
< |
int i = 1; |
427 |
< |
int vmin = argument(1); |
425 |
> |
double vmin = argument(1); |
426 |
|
|
427 |
< |
while (i++ < n) { |
428 |
< |
double v = argument(i); |
427 |
> |
while (n > 1) { |
428 |
> |
double v = argument(n--); |
429 |
|
if (vmin > v) |
430 |
|
vmin = v; |
431 |
|
} |