Ubuntu
libmath-random-tt800-perl package

libmath-random-tt800-perl 1.01-2build2 source package in Ubuntu

Changelog

libmath-random-tt800-perl (1.01-2build2) precise; urgency=low

  * Rebuild for Perl 5.14.
 -- Colin Watson <email address hidden>   Tue, 15 Nov 2011 20:04:04 +0000

Upload details

Uploaded by:
Colin Watson
Uploaded to:
Precise
Original maintainer:
Debian Perl Group
Architectures:
any
Section:
perl
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Precise release universe perl

Downloads

File Size SHA-256 Checksum
libmath-random-tt800-perl_1.01.orig.tar.gz 3.9 KiB 74e8338b9c232d9acf6f9366374fe5d966dc7c3552fdf7ac80b6a17169c62798
libmath-random-tt800-perl_1.01-2build2.diff.gz 2.7 KiB f88ccdfdc0835928343d385d3422ea489d2be2a88248d806277987d281f96a33
libmath-random-tt800-perl_1.01-2build2.dsc 2.1 KiB b3d412861a256630a1040921c04658990122b3360565141358d393307f908d3b

Available diffs

View changes file

Binary packages built by this source

libmath-random-tt800-perl: Perl module implementing the TT800 algorithm

 Math::Random::TT800 provides an implementation of Makoto Matsumoto and Takuji
 Nishimura's pseudorandom number generator (PRNG) algorithm called TT800. It is
 similar to some other fantastic PRNG algorithms such as the Mersenne Twister
 (see libmath-random-mt-perl) and ISAAC (see libmath-random-isaac-perl). This
 particular implementation is particularly notable because it has no external
 dependencies aside from Perl itself.
 .
 The algorithm itself is described in Matsumoto's article published in ACM
 Transactions on Modelling and Computer Simulation, Volume 4, Issue 3, 1994,
 pages 254-266.
 .
 This algorithm is similar to the Mersenne Twister algorithm but uses a smaller
 array to hold state information (25 elements compared to MT's 624).
 Consequently, the period is much smaller - 2^800-1 versus MT's 2^19937-1.
 The period of ISAAC is 2^8295 values on average.