r34800 - /trunk/libmath-random-tt800-perl/debian/control

[jawnsy-guest at users.alioth.debian.org]

Author: jawnsy-guest
Date: Tue May  5 15:52:33 2009
New Revision: 34800

URL: http://svn.debian.org/wsvn/pkg-perl/?sc=1&rev=34800
Log:
Updated the long description :-)

Modified:
    trunk/libmath-random-tt800-perl/debian/control

Modified: trunk/libmath-random-tt800-perl/debian/control
URL: http://svn.debian.org/wsvn/pkg-perl/trunk/libmath-random-tt800-perl/debian/control?rev=34800&op=diff
==============================================================================
--- trunk/libmath-random-tt800-perl/debian/control (original)
+++ trunk/libmath-random-tt800-perl/debian/control Tue May  5 15:52:33 2009
@@ -14,11 +14,21 @@
 Depends: ${misc:Depends}, ${perl:Depends}, ${shlibs:Depends}
 Suggests: libmath-random-mt-perl, libmath-random-isaac-perl
 Description: Perl module implementing the TT800 algorithm
- Math::Random::TT800 provides an implementation of M. Matsumoto's pseudorandom
- number generator (PRNG) algorithm called TT800. It is a complement to some
- other fantastic PRNG implementations such as libmath-random-mt-perl and is
- particularly notable because it has no external dependencies aside from Perl
- itself.
+ 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 his article published in ACM Transactions
- on Modelling and Computer Simulation, Vol. 4, No. 3, 1994, pages 254-266.
+ 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 us 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.
+ .
+ This module implements both a procedural and object oriented interface.
+ See the perldoc for details on using it.