[newlib-cygwin] Fix a typo in the comment.urn:uuid:fa89d1b2-ff36-ebcf-cdb0-752f13b33b2e2023-09-19T02:49:34ZJeff Johnstonjjohnstn@sourceware.org[newlib-cygwin] Fix a typo in the comment.2022-12-16T17:19:11Zurn:uuid:96eae0f8-8006-36a3-a5c2-c9e2724b79cd
```https://sourceware.org/git/gitweb.cgi?p=newlib-cygwin.git;h=abf672604bd0d8a2ad9f2ec7cae76ad5905c3092

Date:   Wed Dec 14 19:53:47 2022 -0800

Fix a typo in the comment.

The implementation of expf() explains how approximation in the range [0 - 0.34] is done. The comment describes the "Reme" algorithm for constructing the polynomial. This is a typo and should be the "Remez" algorithm. The remez algorithm (or minimax) is used to calculate the coefficients of polynomials in other implementations of exp(0 and log().

See more:
https://en.wikipedia.org/wiki/Remez_algorithm

Diff:
---
newlib/libm/math/e_exp.c | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/newlib/libm/math/e_exp.c b/newlib/libm/math/e_exp.c
index ec26c2099..77652d687 100644
--- a/newlib/libm/math/e_exp.c
+++ b/newlib/libm/math/e_exp.c
@@ -28,7 +28,7 @@
*	the interval [0,0.34658]:
*	Write
*	    R(r**2) = r*(exp(r)+1)/(exp(r)-1) = 2 + r*r/6 - r**4/360 + ...
- *      We use a special Reme algorithm on [0,0.34658] to generate
+ *      We use a special Remez algorithm on [0,0.34658] to generate
* 	a polynomial of degree 5 to approximate R. The maximum error
*	of this polynomial approximation is bounded by 2**-59. In
*	other words,
```