Ubuntu
libmath-random-tt800-perl package

libmath-random-tt800-perl 1.01-4build3 source package in Ubuntu

Changelog

libmath-random-tt800-perl (1.01-4build3) noble; urgency=medium

  * No-change rebuild for perlapi5.38t64.

 -- Matthias Klose <email address hidden>  Sat, 02 Mar 2024 15:52:06 +0100

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Noble
Original maintainer:
Debian Perl Group
Architectures:
any
Section:
perl
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

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-4build3.debian.tar.xz 3.0 KiB ed50f50bca6afa2aa99a8f56d29e776f3116b8579bb6efc3ebe969a6f9bf77d9
libmath-random-tt800-perl_1.01-4build3.dsc 2.1 KiB 347c5bcdb2a7b91bef67cd458b90c968d58885507d5a56d3cc15bec8f5252fcc

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.

libmath-random-tt800-perl-dbgsym: debug symbols for libmath-random-tt800-perl