cpet/openbsd-ports
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Import p5-Math-Random-ISAAC-1.004

Browse Source 
The ISAAC 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 other 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.

with feedback and tweaks by me
committing on behalf of dhill@

OK sthen@
This commit is contained in:
gsoares 2012-04-12 13:53:03 +00:00
parent 041ad86a37
commit 8fcf0f5ce9
4 changed files with 42 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
math/p5-Math-Random-ISAAC/Makefile Normal file
View File

@ -0,0 +1,20 @@
# $OpenBSD: Makefile,v 1.1.1.1 2012/04/12 13:53:03 gsoares Exp $
COMMENT= interface to the ISAAC PRNG algorithm
MODULES= cpan
DISTNAME= Math-Random-ISAAC-1.004
CATEGORIES= math
MAINTAINER= David Hill <dhill@mindcry.org>
# CC0 License
PERMIT_PACKAGE_CDROM= Yes
PERMIT_PACKAGE_FTP= Yes
PERMIT_DISTFILES_CDROM= Yes
PERMIT_DISTFILES_FTP= Yes
REGRESS_DEPENDS= devel/p5-Test-LeakTrace \
devel/p5-Test-NoWarnings
.include <bsd.port.mk>

5
math/p5-Math-Random-ISAAC/distinfo Normal file
View File

@ -0,0 +1,5 @@
MD5 (Math-Random-ISAAC-1.004.tar.gz) = RhELmnu5b+ZBvfrzW9r+xQ==
RMD160 (Math-Random-ISAAC-1.004.tar.gz) = anf8D1e5LpMxwjOg9Z13rK59j+A=
SHA1 (Math-Random-ISAAC-1.004.tar.gz) = DS5CNVntKNhC5pB+OUTWxbbycF8=
SHA256 (Math-Random-ISAAC-1.004.tar.gz) = J3PwL78gfpdF52oDffCL9ajMmH7SPFcEDOf3sVYfK3w=
SIZE (Math-Random-ISAAC-1.004.tar.gz) = 34445

9
math/p5-Math-Random-ISAAC/pkg/DESCR Normal file
View File

@ -0,0 +1,9 @@
The ISAAC 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 other 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.

8
math/p5-Math-Random-ISAAC/pkg/PLIST Normal file
View File

@ -0,0 +1,8 @@
@comment $OpenBSD: PLIST,v 1.1.1.1 2012/04/12 13:53:03 gsoares Exp $
${P5SITE}/Math/
${P5SITE}/Math/Random/
${P5SITE}/Math/Random/ISAAC/
${P5SITE}/Math/Random/ISAAC.pm
${P5SITE}/Math/Random/ISAAC/PP.pm
@man man/man3p/Math::Random::ISAAC.3p
@man man/man3p/Math::Random::ISAAC::PP.3p