Date: Mon, 16 Dec 1996 08:49:09 -0500
Message-Id: <199612161349.IAA01371@delorie.com>
From: DJ Delorie <dj AT delorie DOT com>
To: leathm AT gbrmpa DOT gov DOT au
CC: Kevin AT Quitt DOT net, djgpp AT delorie DOT com
In-reply-to: <32B50729.4D9A@gbrmpa.gov.au> (message from Leath Muller on Mon,
	16 Dec 1996 16:24:13 +0800)
Subject: Re: Is DJGPP that efficient?


> > Also, unless I miss my guess, it's still not completely IEEE compliant in
> > that it doesn't implement the basic trig function set (partial tangent), not
> > to mention hyperbolics, or something as useful as simultaneous sin and cos.
> 
> Wrong again... :)  Well, the simultaneous sin and cos is there, and I am
> not too sure about the hyperbolics (I've never needed it!)

It doesn't implement them completely.  Nearly all the transcendental
functions require you to "massage" the data to get it into the range
the fpu supports.  For example, sin(x) is only valid for small values
of x; you must divide by 2PI and take the sin() of the remainder.
That eats up a lot of cycles.