p5-Math-Random-ISAAC-1.004p1
interface to the ISAAC PRNG algorithm
Back to search · Project homepage
Description
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.
Package information
- Ports path
- math/p5-Math-Random-ISAAC
- Package architecture
- *
- Maintainer
- The OpenBSD ports mailing-list <ports@openbsd.org>
- Categories
- math, perl5
- Available flavors
- None listed
These are ports metadata. Binary availability depends on the release, architecture and mirror. Build and test dependencies are not an installation checklist.