Branch :
| Author | Commit | Date | CI | Message |
|---|---|---|---|---|
| ab45f39a | 2022-03-11 19:36:11 | drop RCS Ids | ||
| 95d31a4b | 2020-07-03 21:44:29 | bump for search.cpan.org->metacpan.org change | ||
| 3318ced0 | 2019-07-12 20:46:54 | replace simple PERMIT_PACKAGE_CDROM=Yes with PERMIT_PACKAGE=Yes | ||
| 09d47bc9 | 2019-05-05 15:15:45 | Remove maintainers per their requests | ||
| a5542a52 | 2017-12-07 18:54:36 | a few more FIX_EXTRACT_PERMISSIONS | ||
| cfbb239b | 2016-03-20 19:56:05 | Remove SHARED_ONLY from all CPAN Perl ports and the cpan and perl MODULES. Add WANTLIB+=perl and PKG_ARCH=* as appropriate. | ||
| 570aa62a | 2015-01-18 03:12:39 | Drop remaining MD5/RMD160/SHA1 checksums. | ||
| 0662a4e9 | 2013-03-11 11:20:26 | PERMIT_* / REGRESS->TEST sweep | ||
| 8fcf0f5c | 2012-04-12 13:53:03 | Import p5-Math-Random-ISAAC-1.004 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@ |