aboutsummaryrefslogtreecommitdiff
path: root/math/p5-Math-Random-ISAAC/pkg-plist
diff options
context:
space:
mode:
authorWen Heping <wen@FreeBSD.org>2009-12-07 14:19:26 +0000
committerWen Heping <wen@FreeBSD.org>2009-12-07 14:19:26 +0000
commitfb32debab6e22238fc3bf4c1847748ecfb838404 (patch)
tree83d1aa4cec2a4388e518ca86e31cba2a579034c7 /math/p5-Math-Random-ISAAC/pkg-plist
parentbbceeb5efd53f13376f6c806c62b9c420cac5cca (diff)
downloadports-fb32debab6e22238fc3bf4c1847748ecfb838404.tar.gz
ports-fb32debab6e22238fc3bf4c1847748ecfb838404.zip
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/
Notes
Notes: svn path=/head/; revision=245337
Diffstat (limited to 'math/p5-Math-Random-ISAAC/pkg-plist')
-rw-r--r--math/p5-Math-Random-ISAAC/pkg-plist5
1 files changed, 5 insertions, 0 deletions
diff --git a/math/p5-Math-Random-ISAAC/pkg-plist b/math/p5-Math-Random-ISAAC/pkg-plist
new file mode 100644
index 000000000000..5ce47d0bd3c7
--- /dev/null
+++ b/math/p5-Math-Random-ISAAC/pkg-plist
@@ -0,0 +1,5 @@
+%%SITE_PERL%%/Math/Random/ISAAC/PP.pm
+%%SITE_PERL%%/Math/Random/ISAAC.pm
+@dirrmtry %%SITE_PERL%%/Math/Random/ISAAC
+@dirrmtry %%SITE_PERL%%/Math/Random
+@dirrmtry %%SITE_PERL%%/Math