mirror of
https://github.com/libsdl-org/SDL.git
synced 2026-04-30 03:04:28 +00:00
CodeSpell
This commit is contained in:
committed by
Özkan Sezer
parent
8b53b77058
commit
d870911202
@@ -38,7 +38,7 @@
|
||||
* If (2) is false, then q = q ; otherwise q = q + 2 .
|
||||
* i+1 i i+1 i
|
||||
*
|
||||
* With some algebric manipulation, it is not difficult to see
|
||||
* With some algebraic manipulation, it is not difficult to see
|
||||
* that (2) is equivalent to
|
||||
* -(i+1)
|
||||
* s + 2 <= y (3)
|
||||
@@ -281,7 +281,7 @@ A. sqrt(x) by Newton Iteration
|
||||
This formula has one division fewer than the one above; however,
|
||||
it requires more multiplications and additions. Also x must be
|
||||
scaled in advance to avoid spurious overflow in evaluating the
|
||||
expression 3y*y+x. Hence it is not recommended uless division
|
||||
expression 3y*y+x. Hence it is not recommended unless division
|
||||
is slow. If division is very slow, then one should use the
|
||||
reciproot algorithm given in section B.
|
||||
|
||||
|
||||
@@ -41,7 +41,7 @@
|
||||
* z = (z-x[i])*2**24
|
||||
*
|
||||
*
|
||||
* y[] ouput result in an array of double precision numbers.
|
||||
* y[] output result in an array of double precision numbers.
|
||||
* The dimension of y[] is:
|
||||
* 24-bit precision 1
|
||||
* 53-bit precision 2
|
||||
|
||||
Reference in New Issue
Block a user