|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1985 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted ! 6: * provided that the above copyright notice and this paragraph are ! 7: * duplicated in all such forms and that any documentation, ! 8: * advertising materials, and other materials related to such ! 9: * distribution and use acknowledge that the software was developed ! 10: * by the University of California, Berkeley. The name of the ! 11: * University may not be used to endorse or promote products derived ! 12: * from this software without specific prior written permission. ! 13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 16: * ! 17: * All recipients should regard themselves as participants in an ongoing ! 18: * research project and hence should feel obligated to report their ! 19: * experiences (good or bad) with these elementary function codes, using ! 20: * the sendbug(8) program, to the authors. ! 21: * ! 22: * @(#)math.h 5.3 (Berkeley) 6/30/88 ! 23: */ ! 24: ! 25: extern double asinh(), acosh(), atanh(); ! 26: extern double erf(), erfc(); ! 27: extern double exp(), expm1(), log(), log10(), log1p(), pow(); ! 28: extern double fabs(), floor(), ceil(), rint(); ! 29: extern double lgamma(); ! 30: extern double hypot(), cabs(); ! 31: extern double copysign(), drem(), logb(), scalb(); ! 32: extern int finite(); ! 33: #if defined(vax)||defined(tahoe) ! 34: extern double infnan(); ! 35: #endif /* defined(vax)||defined(tahoe) */ ! 36: extern double j0(), j1(), jn(), y0(), y1(), yn(); ! 37: extern double sin(), cos(), tan(), asin(), acos(), atan(), atan2(); ! 38: extern double sinh(), cosh(), tanh(); ! 39: extern double cbrt(), sqrt(); ! 40: extern double modf(), ldexp(), frexp(), atof(); ! 41: ! 42: #define HUGE 1.701411733192644270e38
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.