aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Another update from ingydotnet^djgoku

Browse source
This commit is contained in:
Ingy döt Net 2015-11-18 06:14:39 +00:00
parent 91df62d461
commit 948b86eafa
7604 changed files with 108452 additions and 22726 deletions
Download patch file Download diff file Expand all files Collapse all files

2
Task/Random-numbers/DWScript/random-numbers.dw
View file

@ -2,4 +2,4 @@ var values : array [0..999] of Float;
var i : Integer;
for i := values.Low to values.High do
values := RandG(1, 0.5);
values[i] := RandG(1, 0.5);

55
Task/Random-numbers/REXX/random-numbers.rexx
View file

@ -1,38 +1,45 @@
/*REXX pgm gens 1,000 normally distributed #s: mean=1, standard dev.=½.*/
numeric digits 20 /*greater precision than 9 digits*/
parse arg n seed . /*allow specification of N & seed*/
if n=='' | n==',' then n=1000 /*N: is the size of the array.*/
if seed\=='' then call random ,,seed /*SEED: for repeatable random #'s*/
newMean=1 /*desired new mean|arithmetic avg*/
sd=1/2 /*desired new standard deviation.*/
do g=1 for n /*gen N uniform random #'s (0,1].*/
#.g = random(1,1e5) / 1e5 /*RANDOM bif generates integers.*/
end /*g*/ /* [↑] rand integers──►fractions*/
/*REXX pgm gens 1,000 normally distributed #s: mean=1, standard deviation.=½.*/
numeric digits 20 /*the default decimal digit precision=9*/
parse arg n seed . /*allow specification of N and the seed*/
if n=='' | n==',' then n=1000 /*N: is the size of the array. */
if seed\=='' then call random ,,seed /*SEED: for repeatable random numbers. */
newMean=1 /*the desired new mean|arithmetic avg. */
sd=1/2 /*the desired new standard deviation. */
do g=1 for n /*generate N uniform random #'s (0,1].*/
#.g = random(1,1e5) / 1e5 /*REXX's RANDOM BIF generates integers.*/
end /*g*/ /* [↑] rand integers ──► fractions. */
say ' old mean=' mean()
say 'old standard deviation=' stddev()
call pi; pi2=pi+pi /*define pi and also 2*pi. */
say 'old standard deviation=' stdDev()
call pi; pi2=pi+pi /*define pi and also 2 * pi. */
say
do j=1 to n-1 by 2; m=j+1 /*step through iterations by two.*/
_=sd * sqrt(ln(#.j) * -2) /*calculate used-twice expression*/
#.j=_ * cos(pi2*#.m) + newMean /*utilize the Box─Muller method.*/
#.m=_ * sin(pi2*#.m) + newMean /*random number must be: (0,1] */
do j=1 to n-1 by 2; m=j+1 /*step through the iterations by two. */
_=sd * sqrt(ln(#.j) * -2) /*calculate the used-twice expression.*/
#.j=_ * cos(pi2*#.m) + newMean /*utilize the Box─Muller method. */
#.m=_ * sin(pi2*#.m) + newMean /*random number must be: (0,1] */
end /*j*/
say ' new mean=' mean()
say 'new standard deviation=' stddev()
exit /*stick a fork in it, we're done.*/
say 'new standard deviation=' stdDev()
exit /*stick a fork in it, we're all done. */
/*──────────────────────────────────subroutines──────────────────────────────────────────────────────────────────────*/
mean: _=0; do k=1 for n; _=_+#.k; end; return _/n
stddev: _avg=mean(); _=0; do k=1 for n; _=_+(#.k-_avg)**2; end; return sqrt(_/n)
stdDev: _avg=mean(); _=0; do k=1 for n; _=_+(#.k-_avg)**2; end; return sqrt(_/n)
e: e =2.7182818284590452353602874713526624977572470936999595749669676277240766303535; return e /*digs overkill*/
pi: pi=3.1415926535897932384626433832795028841971693993751058209749445923078164062862; return pi /* " " */
r2r: return arg(1) // (2*pi()) /*normalize ang*/
sqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); numeric digits 11; numeric form; m.=11; p=d+d%4+2
parse value format(x,2,1,,0) 'E0' with g 'E' _ .; g=g*.5'E'_%2; do j=0 while p>9; m.j=p; p=p%2+1; end
do k=j+5 to 0 by -1; if m.k>11 then numeric digits m.k; g=.5*(g+x/g); end; numeric digits d; return g/1
cos: procedure; parse arg x; x=r2r(x); a=abs(x); numeric fuzz min(9,digits()-9); if a=pi then return -1; pi2=pi+pi
if a=pi*.5|a=pi2 then return 0; if a=pi/3 then return .5; if a=pi2/3 then return -.5; return .sincos(1,1,-1)
sin: procedure; parse arg x;x=r2r(x);numeric fuzz min(5,digits()-3);if abs(x)=pi then return 0;return .sincos(x,x,1)
.sincos:parse arg z,_,i; x=x*x; p=z; do k=2 by 2; _=-_*x/(k*(k+i)); z=z+_; if z=p then leave; p=z; end; return z
ln: procedure; parse arg x,f; call e; ig= x>1.5; is=1-2*(ig\==1); ii=0; xx=x; return .ln_comp()
.ln_comp: do while ig&xx>1.5|\ig&xx<.5;_=e;do k=-1;iz=xx*_**-is;if k>=0&(ig&iz<1|\ig&iz>.5) then leave;_=_*_;izz=iz;end
xx=izz;ii=ii+is*2**k;end;x=x*e**-ii-1;z=0;_=-1;p=z;do k=1;_=-_*x;z=z+_/k;if z=p then leave;p=z;end; return z+ii
cos: procedure; parse arg x; x=r2r(x); a=abs(x); hpi=pi*.5
numeric fuzz min(6,digits()-3); if a=pi() then return -1
if a=hpi | a=hpi*3 then return 0; if a=pi()/3 then return .5
if a=pi()*2/3 then return -.5; return .sinCos(1,1,-1)
sqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); i=; m.=9
numeric digits 9; numeric form; h=d+6; if x<0 then do; x=-x; i='i'; end
parse value format(x,2,1,,0) 'E0' with g 'E' _ .; g=g*.5'e'_%2
do j=0 while h>9; m.j=h; h=h%2+1; end /*j*/
do k=j+5 to 0 by -1; numeric digits m.k; g=(g+x/g)*.5; end /*k*/
numeric digits d; return (g/1)i /*make complex if X < 0.*/

11
Task/Random-numbers/Rust/random-numbers-1.rust Normal file
View file

@ -0,0 +1,11 @@
extern crate rand;
use rand::distributions::{Normal, IndependentSample};
fn main() {
let mut rands = [0.0; 1000];
let normal = Normal::new(1.0, 0.5);
let mut rng = rand::thread_rng();
for num in rands.iter_mut() {
*num = normal.ind_sample(&mut rng);
}
}

10
Task/Random-numbers/Rust/random-numbers-2.rust Normal file
View file

@ -0,0 +1,10 @@
extern crate rand;
use rand::distributions::{Normal, IndependentSample};
fn main() {
let rands: Vec<_> = {
let normal = Normal::new(1.0, 0.5);
let mut rng = rand::thread_rng();
(0..1000).map(|_| normal.ind_sample(&mut rng)).collect()
};
}

12
Task/Random-numbers/Rust/random-numbers.rust
View file

@ -1,12 +0,0 @@
use std::rand;
use std::rand::distributions::{Normal, IndependentSample};
fn main() {
let mut rands = [0.0, ..1000];
let normal = Normal::new(1.0, 0.5);
for i in range(0, 1000) {
let v = normal.ind_sample(&mut rand::task_rng());
rands[i] = v;
}
}