FreeBSD ports tree https://cgit-dev.freebsd.org/ports/atom?h=7-eol 2012-01-21T17:40:15Z 2012-01-21T17:40:15Z Eitan Adler eadler@FreeBSD.org 2012-01-21T17:40:15Z urn:sha1:c59a3834c4bd220def36c5006080d4e0f57b83e0 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 2011-06-20T08:37:15Z Andrej Zverev az@FreeBSD.org 2011-06-20T08:37:15Z urn:sha1:dec946ad510fca42e9c94b55d1d6a14f61b52298 See http://wiki.freebsd.org/Perl for details. - Change maintainership from ports@ to perl@ for ports in this changeset. - Remove MD5 checksum 2011-02-20T08:15:53Z Wen Heping wen@FreeBSD.org 2011-02-20T08:15:53Z urn:sha1:8a2889614509e39ea2e7ea14b13127790215c1ab ChangeLog: http://cpansearch.perl.org/src/JAWNSY/Math-Random-ISAAC-XS-1.004/Changes 2009-12-07T14:41:50Z Wen Heping wen@FreeBSD.org 2009-12-07T14:41:50Z urn:sha1:2956f23b0948d4c88631551740eebf6abc8e22fa 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/