[no description] https://git.osdyson.ru/mirror/pkgsrc/atom?h=pkgsrc_2015Q2 2015-06-12T10:48:20Z 2015-06-12T10:48:20Z wiz wiz 2015-06-12T10:48:20Z urn:sha1:d7e6a8e21511c63470d97ade9d2cffc729577f99 having a PKGNAME of p5-*, or depending such a package, for perl-5.22.0. 2014-05-29T23:35:13Z wiz wiz 2014-05-29T23:35:13Z urn:sha1:4066bdbe3ce000ed62b39d05cfd4e3d5f664affe Do it for all packages that * mention perl, or * have a directory name starting with p5-*, or * depend on a package starting with p5- like last time, for 5.18, where this didn't lead to complaints. Let me know if you have any this time. 2013-07-03T14:33:32Z sno sno 2013-07-03T14:33:32Z urn:sha1:69b18e1309ab3662c98742321b9ac38d264c4f94 math/p5-Math-Random-ISAAC. 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. The results are uniformly distributed, unbiased, and unpredictable unless you know the seed. The algorithm was published by Bob Jenkins in the late 90s and despite the best efforts of many security researchers, no feasible attacks have been found to date.