diff options
| author | Wen Heping <wen@FreeBSD.org> | 2009-12-07 14:41:50 +0000 |
|---|---|---|
| committer | Wen Heping <wen@FreeBSD.org> | 2009-12-07 14:41:50 +0000 |
| commit | 2956f23b0948d4c88631551740eebf6abc8e22fa (patch) | |
| tree | af9b21bff65c7521b866c8dd4e546ad52492a157 /math/p5-Math-Random-ISAAC-XS/pkg-descr | |
| parent | 5ff2b98adedbfc317dceb3a765d3f3a9a80bfd2c (diff) | |
| download | ports-2956f23b0948d4c88631551740eebf6abc8e22fa.tar.gz ports-2956f23b0948d4c88631551740eebf6abc8e22fa.zip | |
Notes
Diffstat (limited to 'math/p5-Math-Random-ISAAC-XS/pkg-descr')
| -rw-r--r-- | math/p5-Math-Random-ISAAC-XS/pkg-descr | 12 |
1 files changed, 12 insertions, 0 deletions
diff --git a/math/p5-Math-Random-ISAAC-XS/pkg-descr b/math/p5-Math-Random-ISAAC-XS/pkg-descr new file mode 100644 index 000000000000..c764bf79947d --- /dev/null +++ b/math/p5-Math-Random-ISAAC-XS/pkg-descr @@ -0,0 +1,12 @@ +As with other Pseudo-Random Number Generator (PRNG) algorithms like the +Mersenne Twister (see Math::Random::MT), this algorithm is designed to +take some seed information and produce seemingly random results as output. + +However, ISAAC (Indirection, Shift, Accumulate, Add, and Count) has +different goals than these commonly used algorithms. In particular, it's +really fast - on average, it requires only 18.75 machine cycles to generate +a 32-bit value. This makes it suitable for applications where a significant +amount of random data needs to be produced quickly, such solving using the +Monte Carlo method or for games. + +WWW: http://search.cpan.org/dist/Math-Random-ISAAC-XS/ |