<html><head><meta name="color-scheme" content="light dark"></head><body><pre style="word-wrap: break-word; white-space: pre-wrap;">package Math::Random::ISAAC::PP;
BEGIN {
  $Math::Random::ISAAC::PP::VERSION = '1.004';
}
# ABSTRACT: Pure Perl port of the ISAAC PRNG algorithm

use strict;
use warnings;
use Carp ();


sub new {
  my ($class, @seed) = @_;

  my $seedsize = scalar(@seed);

  my @mm;
  $#mm = $#seed = 255; # predeclare arrays with 256 slots

  # Zero-fill our seed data
  for ($seedsize .. 255) {
    $seed[$_] = 0;
  }

  my $self = {
    randrsl   =&gt; \@seed,
    randcnt   =&gt; 0,
    randmem   =&gt; \@mm,

    randa     =&gt; 0,
    randb     =&gt; 0,
    randc     =&gt; 0,
  };

  bless($self, $class);

  $self-&gt;_randinit();

  return $self;
}


# This package should have an interface similar to the builtin Perl
# random number routines; these are methods, not functions, so they
# are not problematic
## no critic (ProhibitBuiltinHomonyms)

sub rand {
  my ($self) = @_;

  return ($self-&gt;irand() / (2**32-1));
}


sub irand {
  my ($self) = @_;

  # Reset the sequence if we run out of random stuff
  if (!$self-&gt;{randcnt}--)
  {
    # Call method like this because of our hack above
    _isaac($self);
    $self-&gt;{randcnt} = 255;
  }

  return sprintf('%u', $self-&gt;{randrsl}-&gt;[$self-&gt;{randcnt}]);
}

# C-style for loops are used a lot since this is a port of the C version
## no critic (ProhibitCStyleForLoops)

# Numbers are specified in hex, so they don't need separators
## no critic (RequireNumberSeparators)

sub _isaac {
  my ($self) = @_;

  # Use integer math
  use integer;

  my $mm = $self-&gt;{randmem};
  my $r = $self-&gt;{randrsl};

  # $a and $b are reserved (see 'sort')
  my $aa = $self-&gt;{randa};
  my $bb = ($self-&gt;{randb} + (++$self-&gt;{randc})) &amp; 0xffffffff;

  my ($x, $y); # temporary storage

  # The C code deals with two halves of the randmem separately; we deal with
  # it here in one loop, by adding the &amp;0xff parts. These calls represent the
  # rngstep() macro, but it's inlined here for speed.
  for (my $i = 0; $i &lt; 256; $i += 4)
  {
    $x = $mm-&gt;[$i  ];
    $aa = (($aa ^ ($aa &lt;&lt; 13)) + $mm-&gt;[($i   + 128) &amp; 0xff]);
    $aa &amp;= 0xffffffff; # Mask out high bits for 64-bit systems
    $mm-&gt;[$i  ] = $y = ($mm-&gt;[($x &gt;&gt; 2) &amp; 0xff] + $aa + $bb) &amp; 0xffffffff;
    $r-&gt;[$i  ] = $bb = ($mm-&gt;[($y &gt;&gt; 10) &amp; 0xff] + $x) &amp; 0xffffffff;

    # I don't actually know why the "0x03ffffff" stuff is for. It was in
    # John L. Allen's code. If you can explain this please file a bug report.
    $x = $mm-&gt;[$i+1];
    $aa = (($aa ^ (0x03ffffff &amp; ($aa &gt;&gt; 6))) + $mm-&gt;[($i+1+128) &amp; 0xff]);
    $aa &amp;= 0xffffffff;
    $mm-&gt;[$i+1] = $y = ($mm-&gt;[($x &gt;&gt; 2) &amp; 0xff] + $aa + $bb) &amp; 0xffffffff;
    $r-&gt;[$i+1] = $bb = ($mm-&gt;[($y &gt;&gt; 10) &amp; 0xff] + $x) &amp; 0xffffffff;

    $x = $mm-&gt;[$i+2];
    $aa = (($aa ^ ($aa &lt;&lt; 2)) + $mm-&gt;[($i+2 + 128) &amp; 0xff]);
    $aa &amp;= 0xffffffff;
    $mm-&gt;[$i+2] = $y = ($mm-&gt;[($x &gt;&gt; 2) &amp; 0xff] + $aa + $bb) &amp; 0xffffffff;
    $r-&gt;[$i+2] = $bb = ($mm-&gt;[($y &gt;&gt; 10) &amp; 0xff] + $x) &amp; 0xffffffff;

    $x = $mm-&gt;[$i+3];
    $aa = (($aa ^ (0x0000ffff &amp; ($aa &gt;&gt; 16))) + $mm-&gt;[($i+3 + 128) &amp; 0xff]);
    $aa &amp;= 0xffffffff;
    $mm-&gt;[$i+3] = $y = ($mm-&gt;[($x &gt;&gt; 2) &amp; 0xff] + $aa + $bb) &amp; 0xffffffff;
    $r-&gt;[$i+3] = $bb = ($mm-&gt;[($y &gt;&gt; 10) &amp; 0xff] + $x) &amp; 0xffffffff;
  }

  $self-&gt;{randb} = $bb;
  $self-&gt;{randa} = $aa;

  return;
}

sub _randinit
{
  my ($self) = @_;

  use integer;

  # $a and $b are reserved (see 'sort'); $i is the iterator
  my ($c, $d, $e, $f, $g, $h, $j, $k);
  $c=$d=$e=$f=$g=$h=$j=$k = 0x9e3779b9; # The golden ratio

  my $mm = $self-&gt;{randmem};
  my $r = $self-&gt;{randrsl};

  for (1..4)
  {
    $c ^= $d &lt;&lt; 11;
    $f += $c;
    $d += $e;

    $d ^= 0x3fffffff &amp; ($e &gt;&gt; 2);
    $g += $d;
    $e += $f;

    $e ^= $f &lt;&lt; 8;
    $h += $e;
    $f += $g;

    $f ^= 0x0000ffff &amp; ($g &gt;&gt; 16);
    $j += $f;
    $g += $h;

    $g ^= $h &lt;&lt; 10;
    $k += $g;
    $h += $j;

    $h ^= 0x0fffffff &amp; ($j &gt;&gt; 4);
    $c += $h;
    $j += $k;

    $j ^= $k &lt;&lt; 8;
    $d += $j;
    $k += $c;

    $k ^= 0x007fffff &amp; ($c &gt;&gt; 9);
    $e += $k;
    $c += $d;
  }

  for (my $i = 0; $i &lt; 256; $i += 8)
  {
    $c += $r-&gt;[$i  ];
    $d += $r-&gt;[$i+1];
    $e += $r-&gt;[$i+2];
    $f += $r-&gt;[$i+3];
    $g += $r-&gt;[$i+4];
    $h += $r-&gt;[$i+5];
    $j += $r-&gt;[$i+6];
    $k += $r-&gt;[$i+7];

    $c ^= $d &lt;&lt; 11;
    $f += $c;
    $d += $e;

    $d ^= 0x3fffffff &amp; ($e &gt;&gt; 2);
    $g += $d;
    $e += $f;

    $e ^= $f &lt;&lt; 8;
    $h += $e;
    $f += $g;

    $f ^= 0x0000ffff &amp; ($g &gt;&gt; 16);
    $j += $f;
    $g += $h;

    $g ^= $h &lt;&lt; 10;
    $k += $g;
    $h += $j;

    $h ^= 0x0fffffff &amp; ($j &gt;&gt; 4);
    $c += $h;
    $j += $k;

    $j ^= $k &lt;&lt; 8;
    $d += $j;
    $k += $c;

    $k ^= 0x007fffff &amp; ($c &gt;&gt; 9);
    $e += $k;
    $c += $d;

    $mm-&gt;[$i  ] = $c;
    $mm-&gt;[$i+1] = $d;
    $mm-&gt;[$i+2] = $e;
    $mm-&gt;[$i+3] = $f;
    $mm-&gt;[$i+4] = $g;
    $mm-&gt;[$i+5] = $h;
    $mm-&gt;[$i+6] = $j;
    $mm-&gt;[$i+7] = $k;
  }

  for (my $i = 0; $i &lt; 256; $i += 8)
  {
    $c += $mm-&gt;[$i  ];
    $d += $mm-&gt;[$i+1];
    $e += $mm-&gt;[$i+2];
    $f += $mm-&gt;[$i+3];
    $g += $mm-&gt;[$i+4];
    $h += $mm-&gt;[$i+5];
    $j += $mm-&gt;[$i+6];
    $k += $mm-&gt;[$i+7];

    $c ^= $d &lt;&lt; 11;
    $f += $c;
    $d += $e;

    $d ^= 0x3fffffff &amp; ($e &gt;&gt; 2);
    $g += $d;
    $e += $f;

    $e ^= $f &lt;&lt; 8;
    $h += $e;
    $f += $g;

    $f ^= 0x0000ffff &amp; ($g &gt;&gt; 16);
    $j += $f;
    $g += $h;

    $g ^= $h &lt;&lt; 10;
    $k += $g;
    $h += $j;

    $h ^= 0x0fffffff &amp; ($j &gt;&gt; 4);
    $c += $h;
    $j += $k;

    $j ^= $k &lt;&lt; 8;
    $d += $j;
    $k += $c;

    $k ^= 0x007fffff &amp; ($c &gt;&gt; 9);
    $e += $k;
    $c += $d;

    $mm-&gt;[$i  ] = $c;
    $mm-&gt;[$i+1] = $d;
    $mm-&gt;[$i+2] = $e;
    $mm-&gt;[$i+3] = $f;
    $mm-&gt;[$i+4] = $g;
    $mm-&gt;[$i+5] = $h;
    $mm-&gt;[$i+6] = $j;
    $mm-&gt;[$i+7] = $k;
  }

  $self-&gt;_isaac();
  $self-&gt;{randcnt} = 256;

  return;
}


1;

__END__
=pod

=head1 NAME

Math::Random::ISAAC::PP - Pure Perl port of the ISAAC PRNG algorithm

=head1 VERSION

version 1.004

=head1 SYNOPSIS

This module implements the same interface as C&lt;Math::Random::ISAAC&gt; and can be
used as a drop-in replacement. However, it is recommended that you let the
C&lt;Math::Random::ISAAC&gt; module decide whether to use the PurePerl or XS version
of this module, instead of choosing manually.

Selecting the backend to use manually really only has two uses:

=over

=item *

If you are trying to avoid the small overhead incurred with dispatching method
calls to the appropriate backend modules.

=item *

If you are testing the module for performance and wish to explicitly decide
which module you would like to use.

=back

Example code:

  # With Math::Random::ISAAC
  my $rng = Math::Random::ISAAC-&gt;new(time);
  my $rand = $rng-&gt;rand();

  # With Math::Random::ISAAC::PP
  my $rng = Math::Random::ISAAC::PP-&gt;new(time);
  my $rand = $rng-&gt;rand();

=head1 DESCRIPTION

See L&lt;Math::Random::ISAAC&gt; for the full description.

=head1 METHODS

=head2 new

  Math::Random::ISAAC::PP-&gt;new( @seeds )

Implements the interface as specified in C&lt;Math::Random::ISAAC&gt;

=head2 rand

  $rng-&gt;rand()

Implements the interface as specified in C&lt;Math::Random::ISAAC&gt;

=head2 irand

  $rng-&gt;irand()

Implements the interface as specified in C&lt;Math::Random::ISAAC&gt;

=head1 SEE ALSO

L&lt;Math::Random::ISAAC&gt;

=head1 BUGS

Please report any bugs or feature requests on the bugtracker website
http://rt.cpan.org/NoAuth/Bugs.html?Dist=Math-Random-ISAAC

When submitting a bug or request, please include a test-file or a
patch to an existing test-file that illustrates the bug or desired
feature.

=head1 AUTHOR

Jonathan Yu &lt;jawnsy@cpan.org&gt;

=head1 COPYRIGHT AND LICENSE

Legally speaking, this package and its contents are:

  Copyright (c) 2011 by Jonathan Yu &lt;jawnsy@cpan.org&gt;.

But this is really just a legal technicality that allows the author to
offer this package under the public domain and also a variety of licensing
options. For all intents and purposes, this is public domain software,
which means you can do whatever you want with it.

The software is provided "AS IS", without warranty of any kind, express or
implied, including but not limited to the warranties of merchantability,
fitness for a particular purpose and noninfringement. In no event shall the
authors or copyright holders be liable for any claim, damages or other
liability, whether in an action of contract, tort or otherwise, arising from,
out of or in connection with the software or the use or other dealings in
the software.

=cut

</pre></body></html>