8fcf0f5ce9
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@
21 lines
438 B
Makefile
21 lines
438 B
Makefile
# $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>
|