|
|
1.1 ! root 1: /* llib-lm 1.4 87/04/13 */ ! 2: /* LINTLIBRARY */ ! 3: double acos(x) double x; { return x; } ! 4: double acosh(x) double x; { return x; } ! 5: double asin(x) double x; { return x; } ! 6: double asinh(x) double x; { return x; } ! 7: double atan(x) double x; { return x; } ! 8: double atanh(x) double x; { return x; } ! 9: double atan2(x,y) double x,y; { return x; } ! 10: double cabs(z) struct {double x, y;} z; { return z.x; } ! 11: double cbrt(x) double x; { return x; } ! 12: double ceil(x) double x; { return x; } ! 13: double copysign(x,y) double x,y; { return x; } ! 14: double cos(x) double x; { return x; } ! 15: double cosh(x) double x; { return x; } ! 16: double drem(x,y) double x,y; { return x; } ! 17: double erf(x) double x; { return x; } ! 18: double erfc(x) double x; { return x; } ! 19: double exp(x) double x; { return x; } ! 20: double expm1(x) double x; { return x; } ! 21: double fabs(x) double x; { return x; } ! 22: int finite(x) double x; { return 0; } ! 23: double floor(x) double x; { return x; } ! 24: double gamma(x) double x; { return x; } ! 25: double hypot(x,y) double x,y; { return x; } ! 26: double infnan(i) { return 1.0; }; ! 27: double j0(x) double x; { return x; } ! 28: double j1(x) double x; { return x; } ! 29: double jn(n,x) double x; { return x; } ! 30: double lgamma(x) double x; { return x; } ! 31: double log(x) double x; { return x; } ! 32: double logb(x) double x; { return x; } ! 33: double log10(x) double x; { return x; } ! 34: double log1p(x) double x; { return x; } ! 35: double pow(x,y) double x,y; { return x; } ! 36: double rint(x) double x; { return x; } ! 37: double scalb(x,n) double x; { return x; } ! 38: double sin(x) double x; { return x; } ! 39: double sinh(x) double x; { return x; } ! 40: double sqrt(x) double x; { return x; } ! 41: double tan(x) double x; { return x; } ! 42: double tanh(x) double x; { return x; } ! 43: double y0(x) double x; { return x; } ! 44: double y1(x) double x; { return x; } ! 45: double yn(n,x) double x; { return x; }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.