diff options
| author | Steve Kargl <kargl@FreeBSD.org> | 2022-09-19 18:38:48 +0000 |
|---|---|---|
| committer | Konstantin Belousov <kib@FreeBSD.org> | 2022-09-22 11:19:23 +0000 |
| commit | 3b6fbe6e987a02e16d87b65a0b7ee2f2c5936ed1 (patch) | |
| tree | 4f4c619ea94945c335e705bfdc6681a0d5aa1cb8 | |
| parent | 22ea3be839edcc877c4199081147499065595d09 (diff) | |
| download | src-3b6fbe6e987a02e16d87b65a0b7ee2f2c5936ed1.tar.gz src-3b6fbe6e987a02e16d87b65a0b7ee2f2c5936ed1.zip | |
msun: correct comment
PR: 266503
(cherry picked from commit 620d855faca136d661a86dfa4cf74dd4f8794740)
| -rw-r--r-- | lib/msun/src/e_jn.c | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/lib/msun/src/e_jn.c b/lib/msun/src/e_jn.c index c7ba7da6567b..5aaebd400065 100644 --- a/lib/msun/src/e_jn.c +++ b/lib/msun/src/e_jn.c @@ -22,15 +22,15 @@ __FBSDID("$FreeBSD$"); * y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal; * y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal. * Note 2. About jn(n,x), yn(n,x) - * For n=0, j0(x) is called, - * for n=1, j1(x) is called, - * for n<x, forward recursion us used starting + * For n=0, j0(x) is called. + * For n=1, j1(x) is called. + * For n<x, forward recursion is used starting * from values of j0(x) and j1(x). - * for n>x, a continued fraction approximation to + * For n>x, a continued fraction approximation to * j(n,x)/j(n-1,x) is evaluated and then backward * recursion is used starting from a supposed value - * for j(n,x). The resulting value of j(0,x) is - * compared with the actual value to correct the + * for j(n,x). The resulting values of j(0,x) or j(1,x) are + * compared with the actual values to correct the * supposed value of j(n,x). * * yn(n,x) is similar in all respects, except |