aboutsummaryrefslogtreecommitdiff
path: root/math/p5-Math-Random-ISAAC-XS
Commit message (Collapse)AuthorAgeFilesLines
* - Stage supportMartin Wilke2014-02-012-3/+1
| | | | Notes: svn path=/head/; revision=342152
* Add NO_STAGE all over the place in preparation for the staging support (cat: ↵Baptiste Daroussin2013-09-201-0/+1
| | | | | | | math) Notes: svn path=/head/; revision=327746
* - Convert to new perl frameworkAndrej Zverev2013-08-061-1/+2
| | | | | | | | | - Trim Makefile header Approved by: wen@ (maintainer) Notes: svn path=/head/; revision=324306
* Do not try to remove a directory not owned by the portBaptiste Daroussin2013-03-132-6/+1
| | | | | | | Reported by: pkg DEVELOPER_MODE Notes: svn path=/head/; revision=314052
* At the moment 1385 ports use BUILD_DEPENDS= ${RUN_DEPENDS} and 450Eitan Adler2012-01-211-1/+1
| | | | | | | | | | | | | ports use BUILD_DEPENDS:= ${RUN_DEPENDS}. This patch fixes ports that are currently broken. This is a temporary measure until we organically stop using := or someone(s) spend a lot of time changing all the ports over. Explicit duplication > := > = and this just moves ports one step to the left Approved by: portmgr Notes: svn path=/head/; revision=289563
* - Replace ../../authors in MASTER_SITE_SUBDIR with CPAN:CPANID macro.Andrej Zverev2011-06-201-1/+1
| | | | | | | | | See http://wiki.freebsd.org/Perl for details. - Change maintainership from ports@ to perl@ for ports in this changeset. - Remove MD5 checksum Notes: svn path=/head/; revision=275886
* - Update to 1.004Wen Heping2011-02-202-4/+4
| | | | | | | ChangeLog: http://cpansearch.perl.org/src/JAWNSY/Math-Random-ISAAC-XS-1.004/Changes Notes: svn path=/head/; revision=269375
* As with other Pseudo-Random Number Generator (PRNG) algorithms like theWen Heping2009-12-074-0/+50
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-XS/ Notes: svn path=/head/; revision=245340