home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
OS/2 Shareware BBS: 10 Tools
/
10-Tools.zip
/
evbl0627.zip
/
everblue_20010627.zip
/
x11
/
Xcms_Math.c
< prev
next >
Wrap
C/C++ Source or Header
|
1999-11-02
|
4KB
|
140 lines
/* $XConsortium: cmsMath.c,v 1.11 95/06/08 23:20:39 gildea Exp $ */
/*
Copyright (c) 1990 X Consortium
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of the X Consortium shall not be
used in advertising or otherwise to promote the sale, use or other dealings
in this Software without prior written authorization from the X Consortium.
*/
/*
* Stephen Gildea, MIT X Consortium, January 1991
*/
#include "Xlib_private.h"
#include "Xcmsint.h"
#if !defined(X_NOT_STDC_ENV) && (defined(__STDC__) || !(defined(sun) || (defined(sony) && !defined(SYSTYPE_SYSV) && !defined(_SYSTYPE_SYSV))))
#include <float.h>
#endif
#ifndef DBL_EPSILON
#define DBL_EPSILON 1e-6
#endif
#ifdef _X_ROOT_STATS
int cbrt_loopcount;
int sqrt_loopcount;
#endif
/* Newton's Method: x_n+1 = x_n - ( f(x_n) / f'(x_n) ) */
/* for cube roots, x^3 - a = 0, x_new = x - 1/3 (x - a/x^2) */
double
_XcmsCubeRoot(a)
double a;
{
register double abs_a, cur_guess, delta;
#ifdef DEBUG
printf("_XcmsCubeRoot passed in %g\n", a);
#endif
#ifdef _X_ROOT_STATS
cbrt_loopcount = 0;
#endif
if (a == 0.)
return 0.;
abs_a = a<0. ? -a : a; /* convert to positive to speed loop tests */
/* arbitrary first guess */
if (abs_a > 1.)
cur_guess = abs_a/8.;
else
cur_guess = abs_a*8.;
do {
#ifdef _X_ROOT_STATS
cbrt_loopcount++;
#endif
delta = (cur_guess - abs_a/(cur_guess*cur_guess))/3.;
cur_guess -= delta;
if (delta < 0.) delta = -delta;
} while (delta >= cur_guess*DBL_EPSILON);
if (a < 0.)
cur_guess = -cur_guess;
#ifdef DEBUG
printf("_XcmsCubeRoot returning %g\n", cur_guess);
#endif
return cur_guess;
}
/* for square roots, x^2 - a = 0, x_new = x - 1/2 (x - a/x) */
double
_XcmsSquareRoot(a)
double a;
{
register double cur_guess, delta;
#ifdef DEBUG
printf("_XcmsSquareRoot passed in %g\n", a);
#endif
#ifdef _X_ROOT_STATS
sqrt_loopcount = 0;
#endif
if (a == 0.)
return 0.;
if (a < 0.) {
/* errno = EDOM; */
return 0.;
}
/* arbitrary first guess */
if (a > 1.)
cur_guess = a/4.;
else
cur_guess = a*4.;
do {
#ifdef _X_ROOT_STATS
sqrt_loopcount++;
#endif
delta = (cur_guess - a/cur_guess)/2.;
cur_guess -= delta;
if (delta < 0.) delta = -delta;
} while (delta >= cur_guess*DBL_EPSILON);
#ifdef DEBUG
printf("_XcmsSquareRoot returning %g\n", cur_guess);
#endif
return cur_guess;
}