kpriv/freebsd-ports
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
freebsd-ports/math/p5-Math-Random-ISAAC/Makefile

23 lines
512 B
Makefile
Raw Normal View History

- Convert to new perl framework - Trim Makefile header Approved by: wen@ (maintainer)
2013-08-06 10:50:49 +02:00
# Created by: Wen Heping <wen@FreeBSD.org>
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/
2009-12-07 15:19:26 +01:00
PORTNAME= Math-Random-ISAAC
- Update to 1.004 ChangeLog: http://cpansearch.perl.org/src/JAWNSY/Math-Random-ISAAC-1.004/Changes
2011-02-20 09:18:23 +01:00
PORTVERSION= 1.004
Fix *_DEPENDS - Add NO_ARCH - Bump PORTREVISION for dependency change PR: 218357 Submitted by: sunpoet (myself) Approved by: wen (maintainer)
2017-04-05 15:35:45 +02:00
PORTREVISION= 2
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/
2009-12-07 15:19:26 +01:00
CATEGORIES= math perl5
MASTER_SITES= CPAN
- Replace ../../authors in MASTER_SITE_SUBDIR with CPAN:CPANID macro. See http://wiki.freebsd.org/Perl for details. - Change maintainership from ports@ to perl@ for ports in this changeset. - Remove MD5 checksum
2011-06-20 10:37:15 +02:00
MASTER_SITE_SUBDIR= CPAN:JAWNSY
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/
2009-12-07 15:19:26 +01:00
PKGNAMEPREFIX= p5-
MAINTAINER= wen@FreeBSD.org
COMMENT= Perl interface to the ISAAC PRNG Algorithm
Fix every instance of RUN_DEPENDS:=${BUILD_DEPENDS} in p5 ports, except for where it resulted in a change in output from build-depends-list or run-depends-list. Approved by: portmgr (adamw)
2018-10-06 15:06:42 +02:00
BUILD_DEPENDS= ${RUN_DEPENDS}
RUN_DEPENDS= p5-Math-Random-ISAAC-XS>0:math/p5-Math-Random-ISAAC-XS
Fix *_DEPENDS - Add NO_ARCH - Bump PORTREVISION for dependency change PR: 218357 Submitted by: sunpoet (myself) Approved by: wen (maintainer)
2017-04-05 15:35:45 +02:00
TEST_DEPENDS= p5-Test-NoWarnings>0:devel/p5-Test-NoWarnings
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/
2009-12-07 15:19:26 +01:00
Fix *_DEPENDS - Add NO_ARCH - Bump PORTREVISION for dependency change PR: 218357 Submitted by: sunpoet (myself) Approved by: wen (maintainer)
2017-04-05 15:35:45 +02:00
NO_ARCH= yes
- Convert to new perl framework - Trim Makefile header Approved by: wen@ (maintainer)
2013-08-06 10:50:49 +02:00
USES= perl5
USE_PERL5= configure
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/
2009-12-07 15:19:26 +01:00
.include <bsd.port.mk>
Reference in a new issue Copy permalink