diff options
| author | James Smith <js5@sanger.ac.uk> | 2022-05-30 22:46:02 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-05-30 22:46:02 +0100 |
| commit | aeef89151dd116a58ecc4b210af69ab44a364f97 (patch) | |
| tree | e396e23c6c4281fdf89887704c7fa8d8f44afb90 | |
| parent | 1ee969c3fb75ca6c1ae6c0ab04a984c9402c643d (diff) | |
| download | perlweeklychallenge-club-aeef89151dd116a58ecc4b210af69ab44a364f97.tar.gz perlweeklychallenge-club-aeef89151dd116a58ecc4b210af69ab44a364f97.tar.bz2 perlweeklychallenge-club-aeef89151dd116a58ecc4b210af69ab44a364f97.zip | |
Update README.md
| -rw-r--r-- | challenge-167/james-smith/README.md | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/challenge-167/james-smith/README.md b/challenge-167/james-smith/README.md index 39b4823570..ec7467c314 100644 --- a/challenge-167/james-smith/README.md +++ b/challenge-167/james-smith/README.md @@ -67,7 +67,7 @@ We will use Lanczos approximation... * If z is less than 0.5 - we use the calulation beased on `gamma(1-z)` multiplied the the factor `PI/sin(PI * z)` * Finally we use the lanczos approximation. * This starts by computing the sum in the map, then computing the value based on this sum - * we use `( map() @PV, fn(z,x) )[-1]` to put this all in one line, we also re-use `$i` after the loop, to store the value of `$z+@PV-1.5` which is used twice AND again to store the final value - so we can decide to round it back down to an integer if we are close to integer value. This I agree is nasty!!! + * we use `( map( {} @PV ), fn(z,x) )[-1]` to put this all in one line, we also re-use `$i` after the loop, to store the value of `$z+@PV-1.5` which is used twice AND again to store the final value - so we can decide to round it back down to an integer if we are close to integer value. This I agree is nasty!!! * `$RP` is `sqrt(2*$PI)` but evaluated for speed ```perl |