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/
This commit is contained in:
Wen Heping 2009-12-07 14:19:26 +00:00
parent bbceeb5efd
commit fb32debab6
Notes: svn2git 2021-03-31 03:12:20 +00:00
svn path=/head/; revision=245337
5 changed files with 46 additions and 0 deletions

View file

@ -329,6 +329,7 @@
SUBDIR += p5-Math-Polygon
SUBDIR += p5-Math-Polynomial-Solve
SUBDIR += p5-Math-Random
SUBDIR += p5-Math-Random-ISAAC
SUBDIR += p5-Math-Random-MT
SUBDIR += p5-Math-Random-MT-Auto
SUBDIR += p5-Math-Random-OO

View file

@ -0,0 +1,25 @@
# New ports collection makefile for: Math::Random::ISAAC
# Date created: 07 Dec, 2009
# Whom: Wen Heping <wen@FreeBSD.org>
#
# $FreeBSD$
#
PORTNAME= Math-Random-ISAAC
PORTVERSION= 1.002
CATEGORIES= math perl5
MASTER_SITES= CPAN
PKGNAMEPREFIX= p5-
MAINTAINER= wen@FreeBSD.org
COMMENT= Perl interface to the ISAAC PRNG Algorithm
BUILD_DEPENDS= p5-Test-NoWarnings>0:${PORTSDIR}/devel/p5-Test-NoWarnings
RUN_DEPENDS= ${BUILD_DEPENDS}
PERL_MODBUILD= yes
MAN3= Math::Random::ISAAC::PP.3 \
Math::Random::ISAAC.3
.include <bsd.port.mk>

View file

@ -0,0 +1,3 @@
MD5 (Math-Random-ISAAC-1.002.tar.gz) = 92bbf5de885b72626160a5b9461bf4d6
SHA256 (Math-Random-ISAAC-1.002.tar.gz) = cdf6428f4a226b55d3f9efffa8ad39f78286cb8e7bf2aeff09f266a2efa9a239
SIZE (Math-Random-ISAAC-1.002.tar.gz) = 43022

View file

@ -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/

View file

@ -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