commons-notifications mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From er...@apache.org
Subject svn commit: r997106 [1/9] - in /websites/production/commons/content/proper/commons-rng: ./ apidocs/ apidocs/org/apache/commons/rng/internal/source32/ apidocs/org/apache/commons/rng/internal/source64/ apidocs/org/apache/commons/rng/internal/util/ apidoc...
Date Sat, 10 Sep 2016 14:26:31 GMT
Author: erans
Date: Sat Sep 10 14:26:30 2016
New Revision: 997106

Log:
Commons Rng web site update.

Modified:
    websites/production/commons/content/proper/commons-rng/apidocs/index-all.html
    websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/KISSRandom.html
    websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/MersenneTwister.html
    websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html
    websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/RandomIntSource.html
    websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/package-summary.html
    websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/package-use.html
    websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/RandomLongSource.html
    websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/package-summary.html
    websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/package-use.html
    websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/util/SeedFactory.html
    websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/KISSRandom.html
    websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/MersenneTwister.html
    websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html
    websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/RandomIntSource.html
    websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source64/RandomLongSource.html
    websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/util/SeedFactory.html
    websites/production/commons/content/proper/commons-rng/changes-report.html
    websites/production/commons/content/proper/commons-rng/checkstyle.html
    websites/production/commons/content/proper/commons-rng/cpd.html
    websites/production/commons/content/proper/commons-rng/dependencies.html
    websites/production/commons/content/proper/commons-rng/dependency-convergence.html
    websites/production/commons/content/proper/commons-rng/dependency-info.html
    websites/production/commons/content/proper/commons-rng/developers.html
    websites/production/commons/content/proper/commons-rng/distribution-management.html
    websites/production/commons/content/proper/commons-rng/download_rng.html
    websites/production/commons/content/proper/commons-rng/findbugs.html
    websites/production/commons/content/proper/commons-rng/index.html
    websites/production/commons/content/proper/commons-rng/integration.html
    websites/production/commons/content/proper/commons-rng/issue-tracking.html
    websites/production/commons/content/proper/commons-rng/jacoco/.sessions.html
    websites/production/commons/content/proper/commons-rng/jacoco/index.html
    websites/production/commons/content/proper/commons-rng/jacoco/jacoco.csv
    websites/production/commons/content/proper/commons-rng/jacoco/jacoco.xml
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.source32/KISSRandom.html
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.source32/KISSRandom.java.html
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.source32/MersenneTwister.html
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.source32/MersenneTwister.java.html
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.source32/MultiplyWithCarry256.html
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.source32/MultiplyWithCarry256.java.html
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.source32/index.html
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.source32/index.source.html
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.util/SeedFactory.html
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.util/SeedFactory.java.html
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.util/index.html
    websites/production/commons/content/proper/commons-rng/jacoco/org.apache.commons.rng.internal.util/index.source.html
    websites/production/commons/content/proper/commons-rng/jdepend-report.html
    websites/production/commons/content/proper/commons-rng/jira-report.html
    websites/production/commons/content/proper/commons-rng/mail-lists.html
    websites/production/commons/content/proper/commons-rng/pmd.html
    websites/production/commons/content/proper/commons-rng/project-info.html
    websites/production/commons/content/proper/commons-rng/project-reports.html
    websites/production/commons/content/proper/commons-rng/project-summary.html
    websites/production/commons/content/proper/commons-rng/rat-report.html
    websites/production/commons/content/proper/commons-rng/source-repository.html
    websites/production/commons/content/proper/commons-rng/surefire-report.html
    websites/production/commons/content/proper/commons-rng/team-list.html
    websites/production/commons/content/proper/commons-rng/userguide/index.html
    websites/production/commons/content/proper/commons-rng/userguide/rng.html
    websites/production/commons/content/proper/commons-rng/xref/org/apache/commons/rng/internal/source32/KISSRandom.html
    websites/production/commons/content/proper/commons-rng/xref/org/apache/commons/rng/internal/source32/MersenneTwister.html
    websites/production/commons/content/proper/commons-rng/xref/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html
    websites/production/commons/content/proper/commons-rng/xref/org/apache/commons/rng/internal/source32/RandomIntSource.html
    websites/production/commons/content/proper/commons-rng/xref/org/apache/commons/rng/internal/source64/RandomLongSource.html
    websites/production/commons/content/proper/commons-rng/xref/org/apache/commons/rng/internal/util/SeedFactory.html

Modified: websites/production/commons/content/proper/commons-rng/apidocs/index-all.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/index-all.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/index-all.html Sat Sep 10 14:26:30 2016
@@ -70,7 +70,7 @@
 <!--   -->
 </a></div>
 <!-- ========= END OF TOP NAVBAR ========= -->
-<div class="contentContainer"><a href="#I:A">A</a>&nbsp;<a href="#I:B">B</a>&nbsp;<a href="#I:C">C</a>&nbsp;<a href="#I:E">E</a>&nbsp;<a href="#I:G">G</a>&nbsp;<a href="#I:I">I</a>&nbsp;<a href="#I:J">J</a>&nbsp;<a href="#I:K">K</a>&nbsp;<a href="#I:L">L</a>&nbsp;<a href="#I:M">M</a>&nbsp;<a href="#I:N">N</a>&nbsp;<a href="#I:O">O</a>&nbsp;<a href="#I:P">P</a>&nbsp;<a href="#I:R">R</a>&nbsp;<a href="#I:S">S</a>&nbsp;<a href="#I:T">T</a>&nbsp;<a href="#I:U">U</a>&nbsp;<a href="#I:V">V</a>&nbsp;<a href="#I:W">W</a>&nbsp;<a href="#I:X">X</a>&nbsp;<a name="I:A">
+<div class="contentContainer"><a href="#I:A">A</a>&nbsp;<a href="#I:B">B</a>&nbsp;<a href="#I:C">C</a>&nbsp;<a href="#I:E">E</a>&nbsp;<a href="#I:F">F</a>&nbsp;<a href="#I:G">G</a>&nbsp;<a href="#I:I">I</a>&nbsp;<a href="#I:J">J</a>&nbsp;<a href="#I:K">K</a>&nbsp;<a href="#I:L">L</a>&nbsp;<a href="#I:M">M</a>&nbsp;<a href="#I:N">N</a>&nbsp;<a href="#I:O">O</a>&nbsp;<a href="#I:P">P</a>&nbsp;<a href="#I:R">R</a>&nbsp;<a href="#I:S">S</a>&nbsp;<a href="#I:T">T</a>&nbsp;<a href="#I:U">U</a>&nbsp;<a href="#I:V">V</a>&nbsp;<a href="#I:W">W</a>&nbsp;<a href="#I:X">X</a>&nbsp;<a name="I:A">
 <!--   -->
 </a>
 <h2 class="title">A</h2>
@@ -239,6 +239,16 @@
 <div class="block">Creates an <code>int</code> from a <code>long</code>, using the low order bits.</div>
 </dd>
 </dl>
+<a name="I:F">
+<!--   -->
+</a>
+<h2 class="title">F</h2>
+<dl>
+<dt><span class="memberNameLink"><a href="org/apache/commons/rng/internal/util/SeedFactory.html#fillState-int:A-int:A-">fillState(int[], int[])</a></span> - Static method in class org.apache.commons.rng.internal.util.<a href="org/apache/commons/rng/internal/util/SeedFactory.html" title="class in org.apache.commons.rng.internal.util">SeedFactory</a></dt>
+<dd>
+<div class="block">Simple filling procedure.</div>
+</dd>
+</dl>
 <a name="I:G">
 <!--   -->
 </a>
@@ -726,11 +736,11 @@
 <dl>
 <dt><a href="org/apache/commons/rng/internal/source32/RandomIntSource.html" title="interface in org.apache.commons.rng.internal.source32"><span class="typeNameLink">RandomIntSource</span></a> - Interface in <a href="org/apache/commons/rng/internal/source32/package-summary.html">org.apache.commons.rng.internal.source32</a></dt>
 <dd>
-<div class="block">Source of randomness that generate values of type <code>int</code>.</div>
+<div class="block">Source of randomness that generates values of type <code>int</code>.</div>
 </dd>
 <dt><a href="org/apache/commons/rng/internal/source64/RandomLongSource.html" title="interface in org.apache.commons.rng.internal.source64"><span class="typeNameLink">RandomLongSource</span></a> - Interface in <a href="org/apache/commons/rng/internal/source64/package-summary.html">org.apache.commons.rng.internal.source64</a></dt>
 <dd>
-<div class="block">Source of randomness that generate values of type <code>long</code>.</div>
+<div class="block">Source of randomness that generates values of type <code>long</code>.</div>
 </dd>
 <dt><a href="org/apache/commons/rng/RandomSource.html" title="enum in org.apache.commons.rng"><span class="typeNameLink">RandomSource</span></a> - Enum in <a href="org/apache/commons/rng/package-summary.html">org.apache.commons.rng</a></dt>
 <dd>
@@ -963,7 +973,7 @@ the order they are declared.</div>
 <div class="block">Creates a new instance.</div>
 </dd>
 </dl>
-<a href="#I:A">A</a>&nbsp;<a href="#I:B">B</a>&nbsp;<a href="#I:C">C</a>&nbsp;<a href="#I:E">E</a>&nbsp;<a href="#I:G">G</a>&nbsp;<a href="#I:I">I</a>&nbsp;<a href="#I:J">J</a>&nbsp;<a href="#I:K">K</a>&nbsp;<a href="#I:L">L</a>&nbsp;<a href="#I:M">M</a>&nbsp;<a href="#I:N">N</a>&nbsp;<a href="#I:O">O</a>&nbsp;<a href="#I:P">P</a>&nbsp;<a href="#I:R">R</a>&nbsp;<a href="#I:S">S</a>&nbsp;<a href="#I:T">T</a>&nbsp;<a href="#I:U">U</a>&nbsp;<a href="#I:V">V</a>&nbsp;<a href="#I:W">W</a>&nbsp;<a href="#I:X">X</a>&nbsp;</div>
+<a href="#I:A">A</a>&nbsp;<a href="#I:B">B</a>&nbsp;<a href="#I:C">C</a>&nbsp;<a href="#I:E">E</a>&nbsp;<a href="#I:F">F</a>&nbsp;<a href="#I:G">G</a>&nbsp;<a href="#I:I">I</a>&nbsp;<a href="#I:J">J</a>&nbsp;<a href="#I:K">K</a>&nbsp;<a href="#I:L">L</a>&nbsp;<a href="#I:M">M</a>&nbsp;<a href="#I:N">N</a>&nbsp;<a href="#I:O">O</a>&nbsp;<a href="#I:P">P</a>&nbsp;<a href="#I:R">R</a>&nbsp;<a href="#I:S">S</a>&nbsp;<a href="#I:T">T</a>&nbsp;<a href="#I:U">U</a>&nbsp;<a href="#I:V">V</a>&nbsp;<a href="#I:W">W</a>&nbsp;<a href="#I:X">X</a>&nbsp;</div>
 <!-- ======= START OF BOTTOM NAVBAR ====== -->
 <div class="bottomNav"><a name="navbar.bottom">
 <!--   -->

Modified: websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/KISSRandom.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/KISSRandom.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/KISSRandom.html Sat Sep 10 14:26:30 2016
@@ -124,7 +124,7 @@ var activeTableTab = "activeTableTab";
 </dl>
 <hr>
 <br>
-<pre>public class <a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/KISSRandom.html#line.30">KISSRandom</a>
+<pre>public class <a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/KISSRandom.html#line.31">KISSRandom</a>
 extends <a href="../../../../../../org/apache/commons/rng/internal/source32/IntProvider.html" title="class in org.apache.commons.rng.internal.source32">IntProvider</a></pre>
 <div class="block">Port from Marsaglia's <a href="http://www.cse.yorku.ca/~oz/marsaglia-rng.html">
  "KISS" algorithm</a>.
@@ -230,7 +230,7 @@ extends <a href="../../../../../../org/a
 <ul class="blockListLast">
 <li class="blockList">
 <h4>KISSRandom</h4>
-<pre>public&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/KISSRandom.html#line.50">KISSRandom</a>(int[]&nbsp;seed)</pre>
+<pre>public&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/KISSRandom.html#line.51">KISSRandom</a>(int[]&nbsp;seed)</pre>
 <div class="block">Creates a new instance.</div>
 <dl>
 <dt><span class="paramLabel">Parameters:</span></dt>
@@ -255,7 +255,7 @@ extends <a href="../../../../../../org/a
 <ul class="blockList">
 <li class="blockList">
 <h4>getStateInternal</h4>
-<pre>protected&nbsp;byte[]&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/KISSRandom.html#line.56">getStateInternal</a>()</pre>
+<pre>protected&nbsp;byte[]&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/KISSRandom.html#line.57">getStateInternal</a>()</pre>
 <div class="block">Creates a snapshot of the RNG state.</div>
 <dl>
 <dt><span class="overrideSpecifyLabel">Overrides:</span></dt>
@@ -271,7 +271,7 @@ extends <a href="../../../../../../org/a
 <ul class="blockList">
 <li class="blockList">
 <h4>setStateInternal</h4>
-<pre>protected&nbsp;void&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/KISSRandom.html#line.62">setStateInternal</a>(byte[]&nbsp;s)</pre>
+<pre>protected&nbsp;void&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/KISSRandom.html#line.63">setStateInternal</a>(byte[]&nbsp;s)</pre>
 <div class="block">Resets the RNG to the given <code>state</code>.</div>
 <dl>
 <dt><span class="overrideSpecifyLabel">Overrides:</span></dt>
@@ -290,7 +290,7 @@ extends <a href="../../../../../../org/a
 <ul class="blockListLast">
 <li class="blockList">
 <h4>next</h4>
-<pre>public&nbsp;int&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/KISSRandom.html#line.104">next</a>()</pre>
+<pre>public&nbsp;int&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/KISSRandom.html#line.93">next</a>()</pre>
 <dl>
 <dt><span class="overrideSpecifyLabel">Specified by:</span></dt>
 <dd><code><a href="../../../../../../org/apache/commons/rng/internal/source32/RandomIntSource.html#next--">next</a></code>&nbsp;in interface&nbsp;<code><a href="../../../../../../org/apache/commons/rng/internal/source32/RandomIntSource.html" title="interface in org.apache.commons.rng.internal.source32">RandomIntSource</a></code></dd>

Modified: websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/MersenneTwister.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/MersenneTwister.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/MersenneTwister.html Sat Sep 10 14:26:30 2016
@@ -343,7 +343,7 @@ extends <a href="../../../../../../org/a
 <ul class="blockListLast">
 <li class="blockList">
 <h4>next</h4>
-<pre>public&nbsp;int&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MersenneTwister.html#line.198">next</a>()</pre>
+<pre>public&nbsp;int&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MersenneTwister.html#line.210">next</a>()</pre>
 <dl>
 <dt><span class="overrideSpecifyLabel">Specified by:</span></dt>
 <dd><code><a href="../../../../../../org/apache/commons/rng/internal/source32/RandomIntSource.html#next--">next</a></code>&nbsp;in interface&nbsp;<code><a href="../../../../../../org/apache/commons/rng/internal/source32/RandomIntSource.html" title="interface in org.apache.commons.rng.internal.source32">RandomIntSource</a></code></dd>

Modified: websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html Sat Sep 10 14:26:30 2016
@@ -124,7 +124,7 @@ var activeTableTab = "activeTableTab";
 </dl>
 <hr>
 <br>
-<pre>public class <a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html#line.34">MultiplyWithCarry256</a>
+<pre>public class <a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html#line.35">MultiplyWithCarry256</a>
 extends <a href="../../../../../../org/apache/commons/rng/internal/source32/IntProvider.html" title="class in org.apache.commons.rng.internal.source32">IntProvider</a></pre>
 <div class="block">Port from Marsaglia's <a href="https://en.wikipedia.org/wiki/Multiply-with-carry">
  "Multiply-With-Carry" algorithm</a>.
@@ -233,7 +233,7 @@ extends <a href="../../../../../../org/a
 <ul class="blockListLast">
 <li class="blockList">
 <h4>MultiplyWithCarry256</h4>
-<pre>public&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html#line.56">MultiplyWithCarry256</a>(int[]&nbsp;seed)</pre>
+<pre>public&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html#line.57">MultiplyWithCarry256</a>(int[]&nbsp;seed)</pre>
 <div class="block">Creates a new instance.</div>
 <dl>
 <dt><span class="paramLabel">Parameters:</span></dt>
@@ -258,7 +258,7 @@ extends <a href="../../../../../../org/a
 <ul class="blockList">
 <li class="blockList">
 <h4>getStateInternal</h4>
-<pre>protected&nbsp;byte[]&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html#line.62">getStateInternal</a>()</pre>
+<pre>protected&nbsp;byte[]&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html#line.63">getStateInternal</a>()</pre>
 <div class="block">Creates a snapshot of the RNG state.</div>
 <dl>
 <dt><span class="overrideSpecifyLabel">Overrides:</span></dt>
@@ -274,7 +274,7 @@ extends <a href="../../../../../../org/a
 <ul class="blockList">
 <li class="blockList">
 <h4>setStateInternal</h4>
-<pre>protected&nbsp;void&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html#line.72">setStateInternal</a>(byte[]&nbsp;s)</pre>
+<pre>protected&nbsp;void&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html#line.73">setStateInternal</a>(byte[]&nbsp;s)</pre>
 <div class="block">Resets the RNG to the given <code>state</code>.</div>
 <dl>
 <dt><span class="overrideSpecifyLabel">Overrides:</span></dt>
@@ -293,7 +293,7 @@ extends <a href="../../../../../../org/a
 <ul class="blockListLast">
 <li class="blockList">
 <h4>next</h4>
-<pre>public&nbsp;int&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html#line.119">next</a>()</pre>
+<pre>public&nbsp;int&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html#line.108">next</a>()</pre>
 <dl>
 <dt><span class="overrideSpecifyLabel">Specified by:</span></dt>
 <dd><code><a href="../../../../../../org/apache/commons/rng/internal/source32/RandomIntSource.html#next--">next</a></code>&nbsp;in interface&nbsp;<code><a href="../../../../../../org/apache/commons/rng/internal/source32/RandomIntSource.html" title="interface in org.apache.commons.rng.internal.source32">RandomIntSource</a></code></dd>

Modified: websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/RandomIntSource.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/RandomIntSource.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/RandomIntSource.html Sat Sep 10 14:26:30 2016
@@ -107,7 +107,7 @@ var activeTableTab = "activeTableTab";
 <hr>
 <br>
 <pre>public interface <a href="../../../../../../src-html/org/apache/commons/rng/internal/source32/RandomIntSource.html#line.25">RandomIntSource</a></pre>
-<div class="block">Source of randomness that generate values of type <code>int</code>.</div>
+<div class="block">Source of randomness that generates values of type <code>int</code>.</div>
 <dl>
 <dt><span class="simpleTagLabel">Since:</span></dt>
 <dd>1.0</dd>

Modified: websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/package-summary.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/package-summary.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/package-summary.html Sat Sep 10 14:26:30 2016
@@ -91,7 +91,7 @@
 <tr class="altColor">
 <td class="colFirst"><a href="../../../../../../org/apache/commons/rng/internal/source32/RandomIntSource.html" title="interface in org.apache.commons.rng.internal.source32">RandomIntSource</a></td>
 <td class="colLast">
-<div class="block">Source of randomness that generate values of type <code>int</code>.</div>
+<div class="block">Source of randomness that generates values of type <code>int</code>.</div>
 </td>
 </tr>
 </tbody>

Modified: websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/package-use.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/package-use.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source32/package-use.html Sat Sep 10 14:26:30 2016
@@ -117,7 +117,7 @@
 </tr>
 <tr class="altColor">
 <td class="colOne"><a href="../../../../../../org/apache/commons/rng/internal/source32/class-use/RandomIntSource.html#org.apache.commons.rng.internal.source32">RandomIntSource</a>
-<div class="block">Source of randomness that generate values of type <code>int</code>.</div>
+<div class="block">Source of randomness that generates values of type <code>int</code>.</div>
 </td>
 </tr>
 <tr class="rowColor">

Modified: websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/RandomLongSource.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/RandomLongSource.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/RandomLongSource.html Sat Sep 10 14:26:30 2016
@@ -107,7 +107,7 @@ var activeTableTab = "activeTableTab";
 <hr>
 <br>
 <pre>public interface <a href="../../../../../../src-html/org/apache/commons/rng/internal/source64/RandomLongSource.html#line.25">RandomLongSource</a></pre>
-<div class="block">Source of randomness that generate values of type <code>long</code>.</div>
+<div class="block">Source of randomness that generates values of type <code>long</code>.</div>
 <dl>
 <dt><span class="simpleTagLabel">Since:</span></dt>
 <dd>1.0</dd>

Modified: websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/package-summary.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/package-summary.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/package-summary.html Sat Sep 10 14:26:30 2016
@@ -91,7 +91,7 @@
 <tr class="altColor">
 <td class="colFirst"><a href="../../../../../../org/apache/commons/rng/internal/source64/RandomLongSource.html" title="interface in org.apache.commons.rng.internal.source64">RandomLongSource</a></td>
 <td class="colLast">
-<div class="block">Source of randomness that generate values of type <code>long</code>.</div>
+<div class="block">Source of randomness that generates values of type <code>long</code>.</div>
 </td>
 </tr>
 </tbody>

Modified: websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/package-use.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/package-use.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/source64/package-use.html Sat Sep 10 14:26:30 2016
@@ -110,7 +110,7 @@
 </tr>
 <tr class="rowColor">
 <td class="colOne"><a href="../../../../../../org/apache/commons/rng/internal/source64/class-use/RandomLongSource.html#org.apache.commons.rng.internal.source64">RandomLongSource</a>
-<div class="block">Source of randomness that generate values of type <code>long</code>.</div>
+<div class="block">Source of randomness that generates values of type <code>long</code>.</div>
 </td>
 </tr>
 </tbody>

Modified: websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/util/SeedFactory.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/util/SeedFactory.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/org/apache/commons/rng/internal/util/SeedFactory.html Sat Sep 10 14:26:30 2016
@@ -18,7 +18,7 @@
     catch(err) {
     }
 //-->
-var methods = {"i0":9,"i1":9,"i2":9,"i3":9};
+var methods = {"i0":9,"i1":9,"i2":9,"i3":9,"i4":9};
 var tabs = {65535:["t0","All Methods"],1:["t1","Static Methods"],8:["t4","Concrete Methods"]};
 var altColor = "altColor";
 var rowColor = "rowColor";
@@ -172,6 +172,13 @@ extends <a href="http://docs.oracle.com/
 <div class="block">Creates an array of numbers for use as a seed.</div>
 </td>
 </tr>
+<tr id="i4" class="altColor">
+<td class="colFirst"><code>static void</code></td>
+<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../../org/apache/commons/rng/internal/util/SeedFactory.html#fillState-int:A-int:A-">fillState</a></span>(int[]&nbsp;state,
+         int[]&nbsp;seed)</code>
+<div class="block">Simple filling procedure.</div>
+</td>
+</tr>
 </table>
 <ul class="blockList">
 <li class="blockList"><a name="methods.inherited.from.class.java.lang.Object">
@@ -241,7 +248,7 @@ extends <a href="http://docs.oracle.com/
 <a name="createLongArray-int-">
 <!--   -->
 </a>
-<ul class="blockListLast">
+<ul class="blockList">
 <li class="blockList">
 <h4>createLongArray</h4>
 <pre>public static&nbsp;long[]&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/util/SeedFactory.html#line.96">createLongArray</a>(int&nbsp;n)</pre>
@@ -254,6 +261,34 @@ extends <a href="http://docs.oracle.com/
 </dl>
 </li>
 </ul>
+<a name="fillState-int:A-int:A-">
+<!--   -->
+</a>
+<ul class="blockListLast">
+<li class="blockList">
+<h4>fillState</h4>
+<pre>public static&nbsp;void&nbsp;<a href="../../../../../../src-html/org/apache/commons/rng/internal/util/SeedFactory.html#line.118">fillState</a>(int[]&nbsp;state,
+                             int[]&nbsp;seed)</pre>
+<div class="block">Simple filling procedure.
+ It will
+ <ol>
+  <li>
+   fill the beginning of <code>state</code> by copying
+   <code>min(seed.length, state.length)</code> elements from
+   <code>seed</code>,
+  </li>
+  <li>
+   set all remaining elements of <code>state</code> with non-zero
+   values (even if <code>seed.length &lt; state.length</code>).
+  </li>
+ </ol></div>
+<dl>
+<dt><span class="paramLabel">Parameters:</span></dt>
+<dd><code>state</code> - State. Must be allocated.</dd>
+<dd><code>seed</code> - Seed. Cannot be null.</dd>
+</dl>
+</li>
+</ul>
 </li>
 </ul>
 </li>

Modified: websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/KISSRandom.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/KISSRandom.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/KISSRandom.html Sat Sep 10 14:26:30 2016
@@ -25,118 +25,107 @@
 <span class="sourceLineNo">017</span>package org.apache.commons.rng.internal.source32;<a name="line.17"></a>
 <span class="sourceLineNo">018</span><a name="line.18"></a>
 <span class="sourceLineNo">019</span>import org.apache.commons.rng.internal.util.NumberFactory;<a name="line.19"></a>
-<span class="sourceLineNo">020</span><a name="line.20"></a>
-<span class="sourceLineNo">021</span>/**<a name="line.21"></a>
-<span class="sourceLineNo">022</span> * Port from Marsaglia's &lt;a href="http://www.cse.yorku.ca/~oz/marsaglia-rng.html"&gt;<a name="line.22"></a>
-<span class="sourceLineNo">023</span> * "KISS" algorithm&lt;/a&gt;.<a name="line.23"></a>
-<span class="sourceLineNo">024</span> * This version contains the correction referred to<a name="line.24"></a>
-<span class="sourceLineNo">025</span> * &lt;a href="https://programmingpraxis.com/2010/10/05/george-marsaglias-random-number-generators/"&gt;here&lt;/a&gt;<a name="line.25"></a>
-<span class="sourceLineNo">026</span> * in a reply to the original post.<a name="line.26"></a>
-<span class="sourceLineNo">027</span> *<a name="line.27"></a>
-<span class="sourceLineNo">028</span> * @since 1.0<a name="line.28"></a>
-<span class="sourceLineNo">029</span> */<a name="line.29"></a>
-<span class="sourceLineNo">030</span>public class KISSRandom extends IntProvider {<a name="line.30"></a>
-<span class="sourceLineNo">031</span>    /** Size of the seed. */<a name="line.31"></a>
-<span class="sourceLineNo">032</span>    private static final int SEED_SIZE = 4;<a name="line.32"></a>
-<span class="sourceLineNo">033</span>    /** State variable. */<a name="line.33"></a>
-<span class="sourceLineNo">034</span>    private int z;<a name="line.34"></a>
-<span class="sourceLineNo">035</span>    /** State variable. */<a name="line.35"></a>
-<span class="sourceLineNo">036</span>    private int w;<a name="line.36"></a>
-<span class="sourceLineNo">037</span>    /** State variable. */<a name="line.37"></a>
-<span class="sourceLineNo">038</span>    private int jsr;<a name="line.38"></a>
-<span class="sourceLineNo">039</span>    /** State variable. */<a name="line.39"></a>
-<span class="sourceLineNo">040</span>    private int jcong;<a name="line.40"></a>
-<span class="sourceLineNo">041</span><a name="line.41"></a>
-<span class="sourceLineNo">042</span>    /**<a name="line.42"></a>
-<span class="sourceLineNo">043</span>     * Creates a new instance.<a name="line.43"></a>
-<span class="sourceLineNo">044</span>     *<a name="line.44"></a>
-<span class="sourceLineNo">045</span>     * @param seed Seed.<a name="line.45"></a>
-<span class="sourceLineNo">046</span>     * If the length is larger than 4, only the first 4 elements will<a name="line.46"></a>
-<span class="sourceLineNo">047</span>     * be used; if smaller, the remaining elements will be automatically<a name="line.47"></a>
-<span class="sourceLineNo">048</span>     * set.<a name="line.48"></a>
-<span class="sourceLineNo">049</span>     */<a name="line.49"></a>
-<span class="sourceLineNo">050</span>    public KISSRandom(int[] seed) {<a name="line.50"></a>
-<span class="sourceLineNo">051</span>        setSeedInternal(seed);<a name="line.51"></a>
-<span class="sourceLineNo">052</span>    }<a name="line.52"></a>
-<span class="sourceLineNo">053</span><a name="line.53"></a>
-<span class="sourceLineNo">054</span>    /** {@inheritDoc} */<a name="line.54"></a>
-<span class="sourceLineNo">055</span>    @Override<a name="line.55"></a>
-<span class="sourceLineNo">056</span>    protected byte[] getStateInternal() {<a name="line.56"></a>
-<span class="sourceLineNo">057</span>        return NumberFactory.makeByteArray(new int[] { z, w, jsr, jcong });<a name="line.57"></a>
-<span class="sourceLineNo">058</span>    }<a name="line.58"></a>
-<span class="sourceLineNo">059</span><a name="line.59"></a>
-<span class="sourceLineNo">060</span>    /** {@inheritDoc} */<a name="line.60"></a>
-<span class="sourceLineNo">061</span>    @Override<a name="line.61"></a>
-<span class="sourceLineNo">062</span>    protected void setStateInternal(byte[] s) {<a name="line.62"></a>
-<span class="sourceLineNo">063</span>        checkStateSize(s, SEED_SIZE * 4);<a name="line.63"></a>
-<span class="sourceLineNo">064</span><a name="line.64"></a>
-<span class="sourceLineNo">065</span>        final int[] tmp = NumberFactory.makeIntArray(s);<a name="line.65"></a>
-<span class="sourceLineNo">066</span><a name="line.66"></a>
-<span class="sourceLineNo">067</span>        z = tmp[0];<a name="line.67"></a>
-<span class="sourceLineNo">068</span>        w = tmp[1];<a name="line.68"></a>
-<span class="sourceLineNo">069</span>        jsr = tmp[2];<a name="line.69"></a>
-<span class="sourceLineNo">070</span>        jcong = tmp[3];<a name="line.70"></a>
-<span class="sourceLineNo">071</span>    }<a name="line.71"></a>
-<span class="sourceLineNo">072</span><a name="line.72"></a>
-<span class="sourceLineNo">073</span>    /**<a name="line.73"></a>
-<span class="sourceLineNo">074</span>     * Seeds the RNG.<a name="line.74"></a>
-<span class="sourceLineNo">075</span>     *<a name="line.75"></a>
-<span class="sourceLineNo">076</span>     * @param seed Seed.<a name="line.76"></a>
-<span class="sourceLineNo">077</span>     */<a name="line.77"></a>
-<span class="sourceLineNo">078</span>    private void setSeedInternal(int[] seed) {<a name="line.78"></a>
-<span class="sourceLineNo">079</span>        // Reset the whole state of this RNG (i.e. the 4 state variables).<a name="line.79"></a>
-<span class="sourceLineNo">080</span>        // Seeding procedure is not part of the reference code.<a name="line.80"></a>
-<span class="sourceLineNo">081</span><a name="line.81"></a>
+<span class="sourceLineNo">020</span>import org.apache.commons.rng.internal.util.SeedFactory;<a name="line.20"></a>
+<span class="sourceLineNo">021</span><a name="line.21"></a>
+<span class="sourceLineNo">022</span>/**<a name="line.22"></a>
+<span class="sourceLineNo">023</span> * Port from Marsaglia's &lt;a href="http://www.cse.yorku.ca/~oz/marsaglia-rng.html"&gt;<a name="line.23"></a>
+<span class="sourceLineNo">024</span> * "KISS" algorithm&lt;/a&gt;.<a name="line.24"></a>
+<span class="sourceLineNo">025</span> * This version contains the correction referred to<a name="line.25"></a>
+<span class="sourceLineNo">026</span> * &lt;a href="https://programmingpraxis.com/2010/10/05/george-marsaglias-random-number-generators/"&gt;here&lt;/a&gt;<a name="line.26"></a>
+<span class="sourceLineNo">027</span> * in a reply to the original post.<a name="line.27"></a>
+<span class="sourceLineNo">028</span> *<a name="line.28"></a>
+<span class="sourceLineNo">029</span> * @since 1.0<a name="line.29"></a>
+<span class="sourceLineNo">030</span> */<a name="line.30"></a>
+<span class="sourceLineNo">031</span>public class KISSRandom extends IntProvider {<a name="line.31"></a>
+<span class="sourceLineNo">032</span>    /** Size of the seed. */<a name="line.32"></a>
+<span class="sourceLineNo">033</span>    private static final int SEED_SIZE = 4;<a name="line.33"></a>
+<span class="sourceLineNo">034</span>    /** State variable. */<a name="line.34"></a>
+<span class="sourceLineNo">035</span>    private int z;<a name="line.35"></a>
+<span class="sourceLineNo">036</span>    /** State variable. */<a name="line.36"></a>
+<span class="sourceLineNo">037</span>    private int w;<a name="line.37"></a>
+<span class="sourceLineNo">038</span>    /** State variable. */<a name="line.38"></a>
+<span class="sourceLineNo">039</span>    private int jsr;<a name="line.39"></a>
+<span class="sourceLineNo">040</span>    /** State variable. */<a name="line.40"></a>
+<span class="sourceLineNo">041</span>    private int jcong;<a name="line.41"></a>
+<span class="sourceLineNo">042</span><a name="line.42"></a>
+<span class="sourceLineNo">043</span>    /**<a name="line.43"></a>
+<span class="sourceLineNo">044</span>     * Creates a new instance.<a name="line.44"></a>
+<span class="sourceLineNo">045</span>     *<a name="line.45"></a>
+<span class="sourceLineNo">046</span>     * @param seed Seed.<a name="line.46"></a>
+<span class="sourceLineNo">047</span>     * If the length is larger than 4, only the first 4 elements will<a name="line.47"></a>
+<span class="sourceLineNo">048</span>     * be used; if smaller, the remaining elements will be automatically<a name="line.48"></a>
+<span class="sourceLineNo">049</span>     * set.<a name="line.49"></a>
+<span class="sourceLineNo">050</span>     */<a name="line.50"></a>
+<span class="sourceLineNo">051</span>    public KISSRandom(int[] seed) {<a name="line.51"></a>
+<span class="sourceLineNo">052</span>        setSeedInternal(seed);<a name="line.52"></a>
+<span class="sourceLineNo">053</span>    }<a name="line.53"></a>
+<span class="sourceLineNo">054</span><a name="line.54"></a>
+<span class="sourceLineNo">055</span>    /** {@inheritDoc} */<a name="line.55"></a>
+<span class="sourceLineNo">056</span>    @Override<a name="line.56"></a>
+<span class="sourceLineNo">057</span>    protected byte[] getStateInternal() {<a name="line.57"></a>
+<span class="sourceLineNo">058</span>        return NumberFactory.makeByteArray(new int[] { z, w, jsr, jcong });<a name="line.58"></a>
+<span class="sourceLineNo">059</span>    }<a name="line.59"></a>
+<span class="sourceLineNo">060</span><a name="line.60"></a>
+<span class="sourceLineNo">061</span>    /** {@inheritDoc} */<a name="line.61"></a>
+<span class="sourceLineNo">062</span>    @Override<a name="line.62"></a>
+<span class="sourceLineNo">063</span>    protected void setStateInternal(byte[] s) {<a name="line.63"></a>
+<span class="sourceLineNo">064</span>        checkStateSize(s, SEED_SIZE * 4);<a name="line.64"></a>
+<span class="sourceLineNo">065</span><a name="line.65"></a>
+<span class="sourceLineNo">066</span>        final int[] tmp = NumberFactory.makeIntArray(s);<a name="line.66"></a>
+<span class="sourceLineNo">067</span><a name="line.67"></a>
+<span class="sourceLineNo">068</span>        z = tmp[0];<a name="line.68"></a>
+<span class="sourceLineNo">069</span>        w = tmp[1];<a name="line.69"></a>
+<span class="sourceLineNo">070</span>        jsr = tmp[2];<a name="line.70"></a>
+<span class="sourceLineNo">071</span>        jcong = tmp[3];<a name="line.71"></a>
+<span class="sourceLineNo">072</span>    }<a name="line.72"></a>
+<span class="sourceLineNo">073</span><a name="line.73"></a>
+<span class="sourceLineNo">074</span>    /**<a name="line.74"></a>
+<span class="sourceLineNo">075</span>     * Seeds the RNG.<a name="line.75"></a>
+<span class="sourceLineNo">076</span>     *<a name="line.76"></a>
+<span class="sourceLineNo">077</span>     * @param seed Seed.<a name="line.77"></a>
+<span class="sourceLineNo">078</span>     */<a name="line.78"></a>
+<span class="sourceLineNo">079</span>    private void setSeedInternal(int[] seed) {<a name="line.79"></a>
+<span class="sourceLineNo">080</span>        // Reset the whole state of this RNG (i.e. the 4 state variables).<a name="line.80"></a>
+<span class="sourceLineNo">081</span>        // Seeding procedure is not part of the reference code.<a name="line.81"></a>
 <span class="sourceLineNo">082</span>        final int[] tmp = new int[SEED_SIZE];<a name="line.82"></a>
-<span class="sourceLineNo">083</span>        System.arraycopy(seed, 0, tmp, 0, Math.min(seed.length, tmp.length));<a name="line.83"></a>
+<span class="sourceLineNo">083</span>        SeedFactory.fillState(tmp, seed);<a name="line.83"></a>
 <span class="sourceLineNo">084</span><a name="line.84"></a>
-<span class="sourceLineNo">085</span>        if (seed.length &lt; SEED_SIZE) {<a name="line.85"></a>
-<span class="sourceLineNo">086</span>            for (int i = seed.length; i &lt; SEED_SIZE; i++) {<a name="line.86"></a>
-<span class="sourceLineNo">087</span>                tmp[i] = 26021969 * i;<a name="line.87"></a>
-<span class="sourceLineNo">088</span>            }<a name="line.88"></a>
-<span class="sourceLineNo">089</span>            for (int i = SEED_SIZE - 1; i &gt; seed.length; i--) {<a name="line.89"></a>
-<span class="sourceLineNo">090</span>                tmp[i] ^= tmp[SEED_SIZE - i - 1];<a name="line.90"></a>
-<span class="sourceLineNo">091</span>            }<a name="line.91"></a>
-<span class="sourceLineNo">092</span><a name="line.92"></a>
-<span class="sourceLineNo">093</span>            tmp[seed.length] = 0x80000000; // Ensuring non-zero initial array.<a name="line.93"></a>
-<span class="sourceLineNo">094</span>        }<a name="line.94"></a>
-<span class="sourceLineNo">095</span><a name="line.95"></a>
-<span class="sourceLineNo">096</span>        z = tmp[0];<a name="line.96"></a>
-<span class="sourceLineNo">097</span>        w = tmp[1];<a name="line.97"></a>
-<span class="sourceLineNo">098</span>        jsr = tmp[2];<a name="line.98"></a>
-<span class="sourceLineNo">099</span>        jcong = tmp[3];<a name="line.99"></a>
-<span class="sourceLineNo">100</span>    }<a name="line.100"></a>
-<span class="sourceLineNo">101</span><a name="line.101"></a>
-<span class="sourceLineNo">102</span>    /** {@inheritDoc} */<a name="line.102"></a>
-<span class="sourceLineNo">103</span>    @Override<a name="line.103"></a>
-<span class="sourceLineNo">104</span>    public int next() {<a name="line.104"></a>
-<span class="sourceLineNo">105</span>        z = computeNew(36969, z);<a name="line.105"></a>
-<span class="sourceLineNo">106</span>        w = computeNew(18000, w);<a name="line.106"></a>
-<span class="sourceLineNo">107</span>        final int mwc = (z &lt;&lt; 16) + w;<a name="line.107"></a>
+<span class="sourceLineNo">085</span>        z = tmp[0];<a name="line.85"></a>
+<span class="sourceLineNo">086</span>        w = tmp[1];<a name="line.86"></a>
+<span class="sourceLineNo">087</span>        jsr = tmp[2];<a name="line.87"></a>
+<span class="sourceLineNo">088</span>        jcong = tmp[3];<a name="line.88"></a>
+<span class="sourceLineNo">089</span>    }<a name="line.89"></a>
+<span class="sourceLineNo">090</span><a name="line.90"></a>
+<span class="sourceLineNo">091</span>    /** {@inheritDoc} */<a name="line.91"></a>
+<span class="sourceLineNo">092</span>    @Override<a name="line.92"></a>
+<span class="sourceLineNo">093</span>    public int next() {<a name="line.93"></a>
+<span class="sourceLineNo">094</span>        z = computeNew(36969, z);<a name="line.94"></a>
+<span class="sourceLineNo">095</span>        w = computeNew(18000, w);<a name="line.95"></a>
+<span class="sourceLineNo">096</span>        final int mwc = (z &lt;&lt; 16) + w;<a name="line.96"></a>
+<span class="sourceLineNo">097</span><a name="line.97"></a>
+<span class="sourceLineNo">098</span>        // Cf. correction mentioned in the reply to the original post:<a name="line.98"></a>
+<span class="sourceLineNo">099</span>        //   https://programmingpraxis.com/2010/10/05/george-marsaglias-random-number-generators/<a name="line.99"></a>
+<span class="sourceLineNo">100</span>        jsr ^= jsr &lt;&lt; 13;<a name="line.100"></a>
+<span class="sourceLineNo">101</span>        jsr ^= jsr &gt;&gt;&gt; 17;<a name="line.101"></a>
+<span class="sourceLineNo">102</span>        jsr ^= jsr &lt;&lt; 5;<a name="line.102"></a>
+<span class="sourceLineNo">103</span><a name="line.103"></a>
+<span class="sourceLineNo">104</span>        jcong = 69069 * jcong + 1234567;<a name="line.104"></a>
+<span class="sourceLineNo">105</span><a name="line.105"></a>
+<span class="sourceLineNo">106</span>        return (mwc ^ jcong) + jsr;<a name="line.106"></a>
+<span class="sourceLineNo">107</span>    }<a name="line.107"></a>
 <span class="sourceLineNo">108</span><a name="line.108"></a>
-<span class="sourceLineNo">109</span>        // Cf. correction mentioned in the reply to the original post:<a name="line.109"></a>
-<span class="sourceLineNo">110</span>        //   https://programmingpraxis.com/2010/10/05/george-marsaglias-random-number-generators/<a name="line.110"></a>
-<span class="sourceLineNo">111</span>        jsr ^= jsr &lt;&lt; 13;<a name="line.111"></a>
-<span class="sourceLineNo">112</span>        jsr ^= jsr &gt;&gt;&gt; 17;<a name="line.112"></a>
-<span class="sourceLineNo">113</span>        jsr ^= jsr &lt;&lt; 5;<a name="line.113"></a>
-<span class="sourceLineNo">114</span><a name="line.114"></a>
-<span class="sourceLineNo">115</span>        jcong = 69069 * jcong + 1234567;<a name="line.115"></a>
-<span class="sourceLineNo">116</span><a name="line.116"></a>
-<span class="sourceLineNo">117</span>        return (mwc ^ jcong) + jsr;<a name="line.117"></a>
-<span class="sourceLineNo">118</span>    }<a name="line.118"></a>
-<span class="sourceLineNo">119</span><a name="line.119"></a>
-<span class="sourceLineNo">120</span>    /**<a name="line.120"></a>
-<span class="sourceLineNo">121</span>     * Compute new value.<a name="line.121"></a>
-<span class="sourceLineNo">122</span>     *<a name="line.122"></a>
-<span class="sourceLineNo">123</span>     * @param mult Multiplier.<a name="line.123"></a>
-<span class="sourceLineNo">124</span>     * @param previous Previous value.<a name="line.124"></a>
-<span class="sourceLineNo">125</span>     * @return new value.<a name="line.125"></a>
-<span class="sourceLineNo">126</span>     */<a name="line.126"></a>
-<span class="sourceLineNo">127</span>    private int computeNew(int mult,<a name="line.127"></a>
-<span class="sourceLineNo">128</span>                           int previous) {<a name="line.128"></a>
-<span class="sourceLineNo">129</span>        return mult * (previous &amp; 65535) + (previous &gt;&gt;&gt; 16);<a name="line.129"></a>
-<span class="sourceLineNo">130</span>    }<a name="line.130"></a>
-<span class="sourceLineNo">131</span>}<a name="line.131"></a>
+<span class="sourceLineNo">109</span>    /**<a name="line.109"></a>
+<span class="sourceLineNo">110</span>     * Compute new value.<a name="line.110"></a>
+<span class="sourceLineNo">111</span>     *<a name="line.111"></a>
+<span class="sourceLineNo">112</span>     * @param mult Multiplier.<a name="line.112"></a>
+<span class="sourceLineNo">113</span>     * @param previous Previous value.<a name="line.113"></a>
+<span class="sourceLineNo">114</span>     * @return new value.<a name="line.114"></a>
+<span class="sourceLineNo">115</span>     */<a name="line.115"></a>
+<span class="sourceLineNo">116</span>    private int computeNew(int mult,<a name="line.116"></a>
+<span class="sourceLineNo">117</span>                           int previous) {<a name="line.117"></a>
+<span class="sourceLineNo">118</span>        return mult * (previous &amp; 65535) + (previous &gt;&gt;&gt; 16);<a name="line.118"></a>
+<span class="sourceLineNo">119</span>    }<a name="line.119"></a>
+<span class="sourceLineNo">120</span>}<a name="line.120"></a>
 
 
 

Modified: websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/MersenneTwister.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/MersenneTwister.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/MersenneTwister.html Sat Sep 10 14:26:30 2016
@@ -148,95 +148,107 @@
 <span class="sourceLineNo">140</span>     * @param seed Initial seed.<a name="line.140"></a>
 <span class="sourceLineNo">141</span>     */<a name="line.141"></a>
 <span class="sourceLineNo">142</span>    private void setSeedInternal(int[] seed) {<a name="line.142"></a>
-<span class="sourceLineNo">143</span>        if (seed.length == 0) {<a name="line.143"></a>
-<span class="sourceLineNo">144</span>            // Accept empty seed.<a name="line.144"></a>
-<span class="sourceLineNo">145</span>            seed = new int[1];<a name="line.145"></a>
-<span class="sourceLineNo">146</span>        }<a name="line.146"></a>
-<span class="sourceLineNo">147</span><a name="line.147"></a>
-<span class="sourceLineNo">148</span>        initState(19650218);<a name="line.148"></a>
-<span class="sourceLineNo">149</span>        int i = 1;<a name="line.149"></a>
-<span class="sourceLineNo">150</span>        int j = 0;<a name="line.150"></a>
-<span class="sourceLineNo">151</span><a name="line.151"></a>
-<span class="sourceLineNo">152</span>        for (int k = Math.max(N, seed.length); k != 0; k--) {<a name="line.152"></a>
-<span class="sourceLineNo">153</span>            final long l0 = (mt[i] &amp; LOWER_MASK_LONG) | ((mt[i] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.153"></a>
-<span class="sourceLineNo">154</span>            final long l1 = (mt[i - 1] &amp; LOWER_MASK_LONG) | ((mt[i - 1] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.154"></a>
-<span class="sourceLineNo">155</span>            final long l = (l0 ^ ((l1 ^ (l1 &gt;&gt; 30)) * 1664525l)) + seed[j] + j; // non linear<a name="line.155"></a>
-<span class="sourceLineNo">156</span>            mt[i] = (int) (l &amp; INT_MASK_LONG);<a name="line.156"></a>
-<span class="sourceLineNo">157</span>            i++; j++;<a name="line.157"></a>
-<span class="sourceLineNo">158</span>            if (i &gt;= N) {<a name="line.158"></a>
-<span class="sourceLineNo">159</span>                mt[0] = mt[N - 1];<a name="line.159"></a>
-<span class="sourceLineNo">160</span>                i = 1;<a name="line.160"></a>
-<span class="sourceLineNo">161</span>            }<a name="line.161"></a>
-<span class="sourceLineNo">162</span>            if (j &gt;= seed.length) {<a name="line.162"></a>
-<span class="sourceLineNo">163</span>                j = 0;<a name="line.163"></a>
-<span class="sourceLineNo">164</span>            }<a name="line.164"></a>
-<span class="sourceLineNo">165</span>        }<a name="line.165"></a>
+<span class="sourceLineNo">143</span>        fillStateMersenneTwister(mt, seed);<a name="line.143"></a>
+<span class="sourceLineNo">144</span><a name="line.144"></a>
+<span class="sourceLineNo">145</span>        // Initial index.<a name="line.145"></a>
+<span class="sourceLineNo">146</span>        mti = N;<a name="line.146"></a>
+<span class="sourceLineNo">147</span>    }<a name="line.147"></a>
+<span class="sourceLineNo">148</span><a name="line.148"></a>
+<span class="sourceLineNo">149</span>    /**<a name="line.149"></a>
+<span class="sourceLineNo">150</span>     * Utility for wholly filling a {@code state} array with non-zero<a name="line.150"></a>
+<span class="sourceLineNo">151</span>     * bytes, even if the {@code seed} has a smaller size.<a name="line.151"></a>
+<span class="sourceLineNo">152</span>     * The procedure is the one defined by the standard implementation<a name="line.152"></a>
+<span class="sourceLineNo">153</span>     * of the algorithm.<a name="line.153"></a>
+<span class="sourceLineNo">154</span>     *<a name="line.154"></a>
+<span class="sourceLineNo">155</span>     * @param state State to be filled (must be allocated).<a name="line.155"></a>
+<span class="sourceLineNo">156</span>     * @param seed Seed (cannot be {@code null}).<a name="line.156"></a>
+<span class="sourceLineNo">157</span>     */<a name="line.157"></a>
+<span class="sourceLineNo">158</span>    private static void fillStateMersenneTwister(int[] state,<a name="line.158"></a>
+<span class="sourceLineNo">159</span>                                                 int[] seed) {<a name="line.159"></a>
+<span class="sourceLineNo">160</span>        if (seed.length == 0) {<a name="line.160"></a>
+<span class="sourceLineNo">161</span>            // Accept empty seed.<a name="line.161"></a>
+<span class="sourceLineNo">162</span>            seed = new int[1];<a name="line.162"></a>
+<span class="sourceLineNo">163</span>        }<a name="line.163"></a>
+<span class="sourceLineNo">164</span><a name="line.164"></a>
+<span class="sourceLineNo">165</span>        final int stateSize = state.length;<a name="line.165"></a>
 <span class="sourceLineNo">166</span><a name="line.166"></a>
-<span class="sourceLineNo">167</span>        for (int k = N - 1; k != 0; k--) {<a name="line.167"></a>
-<span class="sourceLineNo">168</span>            final long l0 = (mt[i] &amp; LOWER_MASK_LONG) | ((mt[i] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.168"></a>
-<span class="sourceLineNo">169</span>            final long l1 = (mt[i - 1] &amp; LOWER_MASK_LONG) | ((mt[i - 1] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.169"></a>
-<span class="sourceLineNo">170</span>            final long l  = (l0 ^ ((l1 ^ (l1 &gt;&gt; 30)) * 1566083941l)) - i; // non linear<a name="line.170"></a>
-<span class="sourceLineNo">171</span>            mt[i] = (int) (l &amp; INT_MASK_LONG);<a name="line.171"></a>
-<span class="sourceLineNo">172</span>            i++;<a name="line.172"></a>
-<span class="sourceLineNo">173</span>            if (i &gt;= N) {<a name="line.173"></a>
-<span class="sourceLineNo">174</span>                mt[0] = mt[N - 1];<a name="line.174"></a>
-<span class="sourceLineNo">175</span>                i = 1;<a name="line.175"></a>
-<span class="sourceLineNo">176</span>            }<a name="line.176"></a>
-<span class="sourceLineNo">177</span>        }<a name="line.177"></a>
-<span class="sourceLineNo">178</span><a name="line.178"></a>
-<span class="sourceLineNo">179</span>        mt[0] = UPPER_MASK; // MSB is 1; assuring non-zero initial array<a name="line.179"></a>
-<span class="sourceLineNo">180</span>    }<a name="line.180"></a>
-<span class="sourceLineNo">181</span><a name="line.181"></a>
-<span class="sourceLineNo">182</span>    /**<a name="line.182"></a>
-<span class="sourceLineNo">183</span>     * Initialize the internal state of this instance.<a name="line.183"></a>
-<span class="sourceLineNo">184</span>     *<a name="line.184"></a>
-<span class="sourceLineNo">185</span>     * @param seed Seed.<a name="line.185"></a>
-<span class="sourceLineNo">186</span>     */<a name="line.186"></a>
-<span class="sourceLineNo">187</span>    private void initState(int seed) {<a name="line.187"></a>
-<span class="sourceLineNo">188</span>        long longMT = seed &amp; INT_MASK_LONG;<a name="line.188"></a>
-<span class="sourceLineNo">189</span>        mt[0] = (int) longMT;<a name="line.189"></a>
-<span class="sourceLineNo">190</span>        for (mti = 1; mti &lt; N; ++mti) {<a name="line.190"></a>
-<span class="sourceLineNo">191</span>            longMT = (1812433253L * (longMT ^ (longMT &gt;&gt; 30)) + mti) &amp; INT_MASK_LONG;<a name="line.191"></a>
-<span class="sourceLineNo">192</span>            mt[mti] = (int) longMT;<a name="line.192"></a>
-<span class="sourceLineNo">193</span>        }<a name="line.193"></a>
-<span class="sourceLineNo">194</span>    }<a name="line.194"></a>
-<span class="sourceLineNo">195</span><a name="line.195"></a>
-<span class="sourceLineNo">196</span>    /** {@inheritDoc} */<a name="line.196"></a>
-<span class="sourceLineNo">197</span>    @Override<a name="line.197"></a>
-<span class="sourceLineNo">198</span>    public int next() {<a name="line.198"></a>
-<span class="sourceLineNo">199</span>        int y;<a name="line.199"></a>
-<span class="sourceLineNo">200</span><a name="line.200"></a>
-<span class="sourceLineNo">201</span>        if (mti &gt;= N) { // Generate N words at one time.<a name="line.201"></a>
-<span class="sourceLineNo">202</span>            int mtNext = mt[0];<a name="line.202"></a>
-<span class="sourceLineNo">203</span>            for (int k = 0; k &lt; N - M; ++k) {<a name="line.203"></a>
-<span class="sourceLineNo">204</span>                int mtCurr = mtNext;<a name="line.204"></a>
-<span class="sourceLineNo">205</span>                mtNext = mt[k + 1];<a name="line.205"></a>
-<span class="sourceLineNo">206</span>                y = (mtCurr &amp; UPPER_MASK) | (mtNext &amp; LOWER_MASK);<a name="line.206"></a>
-<span class="sourceLineNo">207</span>                mt[k] = mt[k + M] ^ (y &gt;&gt;&gt; 1) ^ MAG01[y &amp; 1];<a name="line.207"></a>
-<span class="sourceLineNo">208</span>            }<a name="line.208"></a>
-<span class="sourceLineNo">209</span>            for (int k = N - M; k &lt; N - 1; ++k) {<a name="line.209"></a>
-<span class="sourceLineNo">210</span>                int mtCurr = mtNext;<a name="line.210"></a>
-<span class="sourceLineNo">211</span>                mtNext = mt[k + 1];<a name="line.211"></a>
-<span class="sourceLineNo">212</span>                y = (mtCurr &amp; UPPER_MASK) | (mtNext &amp; LOWER_MASK);<a name="line.212"></a>
-<span class="sourceLineNo">213</span>                mt[k] = mt[k + (M - N)] ^ (y &gt;&gt;&gt; 1) ^ MAG01[y &amp; 1];<a name="line.213"></a>
-<span class="sourceLineNo">214</span>            }<a name="line.214"></a>
-<span class="sourceLineNo">215</span>            y = (mtNext &amp; UPPER_MASK) | (mt[0] &amp; LOWER_MASK);<a name="line.215"></a>
-<span class="sourceLineNo">216</span>            mt[N - 1] = mt[M - 1] ^ (y &gt;&gt;&gt; 1) ^ MAG01[y &amp; 1];<a name="line.216"></a>
-<span class="sourceLineNo">217</span><a name="line.217"></a>
-<span class="sourceLineNo">218</span>            mti = 0;<a name="line.218"></a>
-<span class="sourceLineNo">219</span>        }<a name="line.219"></a>
-<span class="sourceLineNo">220</span><a name="line.220"></a>
-<span class="sourceLineNo">221</span>        y = mt[mti++];<a name="line.221"></a>
-<span class="sourceLineNo">222</span><a name="line.222"></a>
-<span class="sourceLineNo">223</span>        // Tempering.<a name="line.223"></a>
-<span class="sourceLineNo">224</span>        y ^=  y &gt;&gt;&gt; 11;<a name="line.224"></a>
-<span class="sourceLineNo">225</span>        y ^= (y &lt;&lt; 7) &amp; 0x9d2c5680;<a name="line.225"></a>
-<span class="sourceLineNo">226</span>        y ^= (y &lt;&lt; 15) &amp; 0xefc60000;<a name="line.226"></a>
-<span class="sourceLineNo">227</span>        y ^=  y &gt;&gt;&gt; 18;<a name="line.227"></a>
-<span class="sourceLineNo">228</span><a name="line.228"></a>
-<span class="sourceLineNo">229</span>        return y;<a name="line.229"></a>
-<span class="sourceLineNo">230</span>    }<a name="line.230"></a>
-<span class="sourceLineNo">231</span>}<a name="line.231"></a>
+<span class="sourceLineNo">167</span>        long mt = 19650218 &amp; INT_MASK_LONG;<a name="line.167"></a>
+<span class="sourceLineNo">168</span>        state[0] = (int) mt;<a name="line.168"></a>
+<span class="sourceLineNo">169</span>        for (int i = 1; i &lt; stateSize; i++) {<a name="line.169"></a>
+<span class="sourceLineNo">170</span>            mt = (1812433253L * (mt ^ (mt &gt;&gt; 30)) + i) &amp; INT_MASK_LONG;<a name="line.170"></a>
+<span class="sourceLineNo">171</span>            state[i] = (int) mt;<a name="line.171"></a>
+<span class="sourceLineNo">172</span>        }<a name="line.172"></a>
+<span class="sourceLineNo">173</span><a name="line.173"></a>
+<span class="sourceLineNo">174</span>        int i = 1;<a name="line.174"></a>
+<span class="sourceLineNo">175</span>        int j = 0;<a name="line.175"></a>
+<span class="sourceLineNo">176</span><a name="line.176"></a>
+<span class="sourceLineNo">177</span>        for (int k = Math.max(stateSize, seed.length); k &gt; 0; k--) {<a name="line.177"></a>
+<span class="sourceLineNo">178</span>            final long a = (state[i] &amp; LOWER_MASK_LONG) | ((state[i] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.178"></a>
+<span class="sourceLineNo">179</span>            final long b = (state[i - 1] &amp; LOWER_MASK_LONG) | ((state[i - 1] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.179"></a>
+<span class="sourceLineNo">180</span>            final long c = (a ^ ((b ^ (b &gt;&gt; 30)) * 1664525L)) + seed[j] + j; // Non linear.<a name="line.180"></a>
+<span class="sourceLineNo">181</span>            state[i] = (int) (c &amp; INT_MASK_LONG);<a name="line.181"></a>
+<span class="sourceLineNo">182</span>            i++;<a name="line.182"></a>
+<span class="sourceLineNo">183</span>            j++;<a name="line.183"></a>
+<span class="sourceLineNo">184</span>            if (i &gt;= stateSize) {<a name="line.184"></a>
+<span class="sourceLineNo">185</span>                state[0] = state[stateSize - 1];<a name="line.185"></a>
+<span class="sourceLineNo">186</span>                i = 1;<a name="line.186"></a>
+<span class="sourceLineNo">187</span>            }<a name="line.187"></a>
+<span class="sourceLineNo">188</span>            if (j &gt;= seed.length) {<a name="line.188"></a>
+<span class="sourceLineNo">189</span>                j = 0;<a name="line.189"></a>
+<span class="sourceLineNo">190</span>            }<a name="line.190"></a>
+<span class="sourceLineNo">191</span>        }<a name="line.191"></a>
+<span class="sourceLineNo">192</span><a name="line.192"></a>
+<span class="sourceLineNo">193</span>        for (int k = stateSize - 1; k &gt; 0; k--) {<a name="line.193"></a>
+<span class="sourceLineNo">194</span>            final long a = (state[i] &amp; LOWER_MASK_LONG) | ((state[i] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.194"></a>
+<span class="sourceLineNo">195</span>            final long b = (state[i - 1] &amp; LOWER_MASK_LONG) | ((state[i - 1] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.195"></a>
+<span class="sourceLineNo">196</span>            final long c = (a ^ ((b ^ (b &gt;&gt; 30)) * 1566083941L)) - i; // Non linear.<a name="line.196"></a>
+<span class="sourceLineNo">197</span>            state[i] = (int) (c &amp; INT_MASK_LONG);<a name="line.197"></a>
+<span class="sourceLineNo">198</span>            i++;<a name="line.198"></a>
+<span class="sourceLineNo">199</span>            if (i &gt;= stateSize) {<a name="line.199"></a>
+<span class="sourceLineNo">200</span>                state[0] = state[stateSize - 1];<a name="line.200"></a>
+<span class="sourceLineNo">201</span>                i = 1;<a name="line.201"></a>
+<span class="sourceLineNo">202</span>            }<a name="line.202"></a>
+<span class="sourceLineNo">203</span>        }<a name="line.203"></a>
+<span class="sourceLineNo">204</span><a name="line.204"></a>
+<span class="sourceLineNo">205</span>        state[0] = (int) UPPER_MASK_LONG; // MSB is 1, ensuring non-zero initial array.<a name="line.205"></a>
+<span class="sourceLineNo">206</span>    }<a name="line.206"></a>
+<span class="sourceLineNo">207</span><a name="line.207"></a>
+<span class="sourceLineNo">208</span>    /** {@inheritDoc} */<a name="line.208"></a>
+<span class="sourceLineNo">209</span>    @Override<a name="line.209"></a>
+<span class="sourceLineNo">210</span>    public int next() {<a name="line.210"></a>
+<span class="sourceLineNo">211</span>        int y;<a name="line.211"></a>
+<span class="sourceLineNo">212</span><a name="line.212"></a>
+<span class="sourceLineNo">213</span>        if (mti &gt;= N) { // Generate N words at one time.<a name="line.213"></a>
+<span class="sourceLineNo">214</span>            int mtNext = mt[0];<a name="line.214"></a>
+<span class="sourceLineNo">215</span>            for (int k = 0; k &lt; N - M; ++k) {<a name="line.215"></a>
+<span class="sourceLineNo">216</span>                int mtCurr = mtNext;<a name="line.216"></a>
+<span class="sourceLineNo">217</span>                mtNext = mt[k + 1];<a name="line.217"></a>
+<span class="sourceLineNo">218</span>                y = (mtCurr &amp; UPPER_MASK) | (mtNext &amp; LOWER_MASK);<a name="line.218"></a>
+<span class="sourceLineNo">219</span>                mt[k] = mt[k + M] ^ (y &gt;&gt;&gt; 1) ^ MAG01[y &amp; 1];<a name="line.219"></a>
+<span class="sourceLineNo">220</span>            }<a name="line.220"></a>
+<span class="sourceLineNo">221</span>            for (int k = N - M; k &lt; N - 1; ++k) {<a name="line.221"></a>
+<span class="sourceLineNo">222</span>                int mtCurr = mtNext;<a name="line.222"></a>
+<span class="sourceLineNo">223</span>                mtNext = mt[k + 1];<a name="line.223"></a>
+<span class="sourceLineNo">224</span>                y = (mtCurr &amp; UPPER_MASK) | (mtNext &amp; LOWER_MASK);<a name="line.224"></a>
+<span class="sourceLineNo">225</span>                mt[k] = mt[k + (M - N)] ^ (y &gt;&gt;&gt; 1) ^ MAG01[y &amp; 1];<a name="line.225"></a>
+<span class="sourceLineNo">226</span>            }<a name="line.226"></a>
+<span class="sourceLineNo">227</span>            y = (mtNext &amp; UPPER_MASK) | (mt[0] &amp; LOWER_MASK);<a name="line.227"></a>
+<span class="sourceLineNo">228</span>            mt[N - 1] = mt[M - 1] ^ (y &gt;&gt;&gt; 1) ^ MAG01[y &amp; 1];<a name="line.228"></a>
+<span class="sourceLineNo">229</span><a name="line.229"></a>
+<span class="sourceLineNo">230</span>            mti = 0;<a name="line.230"></a>
+<span class="sourceLineNo">231</span>        }<a name="line.231"></a>
+<span class="sourceLineNo">232</span><a name="line.232"></a>
+<span class="sourceLineNo">233</span>        y = mt[mti++];<a name="line.233"></a>
+<span class="sourceLineNo">234</span><a name="line.234"></a>
+<span class="sourceLineNo">235</span>        // Tempering.<a name="line.235"></a>
+<span class="sourceLineNo">236</span>        y ^=  y &gt;&gt;&gt; 11;<a name="line.236"></a>
+<span class="sourceLineNo">237</span>        y ^= (y &lt;&lt; 7) &amp; 0x9d2c5680;<a name="line.237"></a>
+<span class="sourceLineNo">238</span>        y ^= (y &lt;&lt; 15) &amp; 0xefc60000;<a name="line.238"></a>
+<span class="sourceLineNo">239</span>        y ^=  y &gt;&gt;&gt; 18;<a name="line.239"></a>
+<span class="sourceLineNo">240</span><a name="line.240"></a>
+<span class="sourceLineNo">241</span>        return y;<a name="line.241"></a>
+<span class="sourceLineNo">242</span>    }<a name="line.242"></a>
+<span class="sourceLineNo">243</span>}<a name="line.243"></a>
 
 
 

Modified: websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/MultiplyWithCarry256.html Sat Sep 10 14:26:30 2016
@@ -26,120 +26,109 @@
 <span class="sourceLineNo">018</span><a name="line.18"></a>
 <span class="sourceLineNo">019</span>import java.util.Arrays;<a name="line.19"></a>
 <span class="sourceLineNo">020</span>import org.apache.commons.rng.internal.util.NumberFactory;<a name="line.20"></a>
-<span class="sourceLineNo">021</span><a name="line.21"></a>
-<span class="sourceLineNo">022</span>/**<a name="line.22"></a>
-<span class="sourceLineNo">023</span> * Port from Marsaglia's &lt;a href="https://en.wikipedia.org/wiki/Multiply-with-carry"&gt;<a name="line.23"></a>
-<span class="sourceLineNo">024</span> * "Multiply-With-Carry" algorithm&lt;/a&gt;.<a name="line.24"></a>
-<span class="sourceLineNo">025</span> *<a name="line.25"></a>
-<span class="sourceLineNo">026</span> * &lt;p&gt;<a name="line.26"></a>
-<span class="sourceLineNo">027</span> * Implementation is based on the (non-portable!) C code reproduced on<a name="line.27"></a>
-<span class="sourceLineNo">028</span> * &lt;a href="http://school.anhb.uwa.edu.au/personalpages/kwessen/shared/Marsaglia03.html"&gt;<a name="line.28"></a>
-<span class="sourceLineNo">029</span> * that page&lt;/a&gt;.<a name="line.29"></a>
-<span class="sourceLineNo">030</span> * &lt;/p&gt;<a name="line.30"></a>
-<span class="sourceLineNo">031</span> *<a name="line.31"></a>
-<span class="sourceLineNo">032</span> * @since 1.0<a name="line.32"></a>
-<span class="sourceLineNo">033</span> */<a name="line.33"></a>
-<span class="sourceLineNo">034</span>public class MultiplyWithCarry256 extends IntProvider {<a name="line.34"></a>
-<span class="sourceLineNo">035</span>    /** Length of the state array. */<a name="line.35"></a>
-<span class="sourceLineNo">036</span>    private static final int Q_SIZE = 256;<a name="line.36"></a>
-<span class="sourceLineNo">037</span>    /** Size of the seed. */<a name="line.37"></a>
-<span class="sourceLineNo">038</span>    private static final int SEED_SIZE = Q_SIZE + 1;<a name="line.38"></a>
-<span class="sourceLineNo">039</span>    /** Multiply. */<a name="line.39"></a>
-<span class="sourceLineNo">040</span>    private static final long A = 809430660;<a name="line.40"></a>
-<span class="sourceLineNo">041</span>    /** State. */<a name="line.41"></a>
-<span class="sourceLineNo">042</span>    private final int[] state = new int[Q_SIZE];<a name="line.42"></a>
-<span class="sourceLineNo">043</span>    /** Current index in "state" array. */<a name="line.43"></a>
-<span class="sourceLineNo">044</span>    private int index;<a name="line.44"></a>
-<span class="sourceLineNo">045</span>    /** Carry. */<a name="line.45"></a>
-<span class="sourceLineNo">046</span>    private int carry;<a name="line.46"></a>
-<span class="sourceLineNo">047</span><a name="line.47"></a>
-<span class="sourceLineNo">048</span>    /**<a name="line.48"></a>
-<span class="sourceLineNo">049</span>     * Creates a new instance.<a name="line.49"></a>
-<span class="sourceLineNo">050</span>     *<a name="line.50"></a>
-<span class="sourceLineNo">051</span>     * @param seed Seed.<a name="line.51"></a>
-<span class="sourceLineNo">052</span>     * If the length is larger than 257, only the first 257 elements will<a name="line.52"></a>
-<span class="sourceLineNo">053</span>     * be used; if smaller, the remaining elements will be automatically<a name="line.53"></a>
-<span class="sourceLineNo">054</span>     * set.<a name="line.54"></a>
-<span class="sourceLineNo">055</span>     */<a name="line.55"></a>
-<span class="sourceLineNo">056</span>    public MultiplyWithCarry256(int[] seed) {<a name="line.56"></a>
-<span class="sourceLineNo">057</span>        setSeedInternal(seed);<a name="line.57"></a>
-<span class="sourceLineNo">058</span>    }<a name="line.58"></a>
-<span class="sourceLineNo">059</span><a name="line.59"></a>
-<span class="sourceLineNo">060</span>    /** {@inheritDoc} */<a name="line.60"></a>
-<span class="sourceLineNo">061</span>    @Override<a name="line.61"></a>
-<span class="sourceLineNo">062</span>    protected byte[] getStateInternal() {<a name="line.62"></a>
-<span class="sourceLineNo">063</span>        final int[] s = Arrays.copyOf(state, SEED_SIZE + 1);<a name="line.63"></a>
-<span class="sourceLineNo">064</span>        s[SEED_SIZE - 1] = carry;<a name="line.64"></a>
-<span class="sourceLineNo">065</span>        s[SEED_SIZE] = index;<a name="line.65"></a>
-<span class="sourceLineNo">066</span><a name="line.66"></a>
-<span class="sourceLineNo">067</span>        return NumberFactory.makeByteArray(s);<a name="line.67"></a>
-<span class="sourceLineNo">068</span>    }<a name="line.68"></a>
-<span class="sourceLineNo">069</span><a name="line.69"></a>
-<span class="sourceLineNo">070</span>    /** {@inheritDoc} */<a name="line.70"></a>
-<span class="sourceLineNo">071</span>    @Override<a name="line.71"></a>
-<span class="sourceLineNo">072</span>    protected void setStateInternal(byte[] s) {<a name="line.72"></a>
-<span class="sourceLineNo">073</span>        checkStateSize(s, (SEED_SIZE + 1) * 4);<a name="line.73"></a>
-<span class="sourceLineNo">074</span><a name="line.74"></a>
-<span class="sourceLineNo">075</span>        final int[] tmp = NumberFactory.makeIntArray(s);<a name="line.75"></a>
-<span class="sourceLineNo">076</span><a name="line.76"></a>
-<span class="sourceLineNo">077</span>        System.arraycopy(tmp, 0, state, 0, Q_SIZE);<a name="line.77"></a>
-<span class="sourceLineNo">078</span>        carry = tmp[SEED_SIZE - 1];<a name="line.78"></a>
-<span class="sourceLineNo">079</span>        index = tmp[SEED_SIZE];<a name="line.79"></a>
-<span class="sourceLineNo">080</span>    }<a name="line.80"></a>
-<span class="sourceLineNo">081</span><a name="line.81"></a>
-<span class="sourceLineNo">082</span>    /**<a name="line.82"></a>
-<span class="sourceLineNo">083</span>     * Seeds the RNG.<a name="line.83"></a>
-<span class="sourceLineNo">084</span>     *<a name="line.84"></a>
-<span class="sourceLineNo">085</span>     * @param seed Seed.<a name="line.85"></a>
-<span class="sourceLineNo">086</span>     */<a name="line.86"></a>
-<span class="sourceLineNo">087</span>    private void setSeedInternal(int[] seed) {<a name="line.87"></a>
-<span class="sourceLineNo">088</span>        // Reset the whole state of this RNG (i.e. "state" and "index").<a name="line.88"></a>
-<span class="sourceLineNo">089</span>        // Seeding procedure is not part of the reference code.<a name="line.89"></a>
-<span class="sourceLineNo">090</span><a name="line.90"></a>
+<span class="sourceLineNo">021</span>import org.apache.commons.rng.internal.util.SeedFactory;<a name="line.21"></a>
+<span class="sourceLineNo">022</span><a name="line.22"></a>
+<span class="sourceLineNo">023</span>/**<a name="line.23"></a>
+<span class="sourceLineNo">024</span> * Port from Marsaglia's &lt;a href="https://en.wikipedia.org/wiki/Multiply-with-carry"&gt;<a name="line.24"></a>
+<span class="sourceLineNo">025</span> * "Multiply-With-Carry" algorithm&lt;/a&gt;.<a name="line.25"></a>
+<span class="sourceLineNo">026</span> *<a name="line.26"></a>
+<span class="sourceLineNo">027</span> * &lt;p&gt;<a name="line.27"></a>
+<span class="sourceLineNo">028</span> * Implementation is based on the (non-portable!) C code reproduced on<a name="line.28"></a>
+<span class="sourceLineNo">029</span> * &lt;a href="http://school.anhb.uwa.edu.au/personalpages/kwessen/shared/Marsaglia03.html"&gt;<a name="line.29"></a>
+<span class="sourceLineNo">030</span> * that page&lt;/a&gt;.<a name="line.30"></a>
+<span class="sourceLineNo">031</span> * &lt;/p&gt;<a name="line.31"></a>
+<span class="sourceLineNo">032</span> *<a name="line.32"></a>
+<span class="sourceLineNo">033</span> * @since 1.0<a name="line.33"></a>
+<span class="sourceLineNo">034</span> */<a name="line.34"></a>
+<span class="sourceLineNo">035</span>public class MultiplyWithCarry256 extends IntProvider {<a name="line.35"></a>
+<span class="sourceLineNo">036</span>    /** Length of the state array. */<a name="line.36"></a>
+<span class="sourceLineNo">037</span>    private static final int Q_SIZE = 256;<a name="line.37"></a>
+<span class="sourceLineNo">038</span>    /** Size of the seed. */<a name="line.38"></a>
+<span class="sourceLineNo">039</span>    private static final int SEED_SIZE = Q_SIZE + 1;<a name="line.39"></a>
+<span class="sourceLineNo">040</span>    /** Multiply. */<a name="line.40"></a>
+<span class="sourceLineNo">041</span>    private static final long A = 809430660;<a name="line.41"></a>
+<span class="sourceLineNo">042</span>    /** State. */<a name="line.42"></a>
+<span class="sourceLineNo">043</span>    private final int[] state = new int[Q_SIZE];<a name="line.43"></a>
+<span class="sourceLineNo">044</span>    /** Current index in "state" array. */<a name="line.44"></a>
+<span class="sourceLineNo">045</span>    private int index;<a name="line.45"></a>
+<span class="sourceLineNo">046</span>    /** Carry. */<a name="line.46"></a>
+<span class="sourceLineNo">047</span>    private int carry;<a name="line.47"></a>
+<span class="sourceLineNo">048</span><a name="line.48"></a>
+<span class="sourceLineNo">049</span>    /**<a name="line.49"></a>
+<span class="sourceLineNo">050</span>     * Creates a new instance.<a name="line.50"></a>
+<span class="sourceLineNo">051</span>     *<a name="line.51"></a>
+<span class="sourceLineNo">052</span>     * @param seed Seed.<a name="line.52"></a>
+<span class="sourceLineNo">053</span>     * If the length is larger than 257, only the first 257 elements will<a name="line.53"></a>
+<span class="sourceLineNo">054</span>     * be used; if smaller, the remaining elements will be automatically<a name="line.54"></a>
+<span class="sourceLineNo">055</span>     * set.<a name="line.55"></a>
+<span class="sourceLineNo">056</span>     */<a name="line.56"></a>
+<span class="sourceLineNo">057</span>    public MultiplyWithCarry256(int[] seed) {<a name="line.57"></a>
+<span class="sourceLineNo">058</span>        setSeedInternal(seed);<a name="line.58"></a>
+<span class="sourceLineNo">059</span>    }<a name="line.59"></a>
+<span class="sourceLineNo">060</span><a name="line.60"></a>
+<span class="sourceLineNo">061</span>    /** {@inheritDoc} */<a name="line.61"></a>
+<span class="sourceLineNo">062</span>    @Override<a name="line.62"></a>
+<span class="sourceLineNo">063</span>    protected byte[] getStateInternal() {<a name="line.63"></a>
+<span class="sourceLineNo">064</span>        final int[] s = Arrays.copyOf(state, SEED_SIZE + 1);<a name="line.64"></a>
+<span class="sourceLineNo">065</span>        s[SEED_SIZE - 1] = carry;<a name="line.65"></a>
+<span class="sourceLineNo">066</span>        s[SEED_SIZE] = index;<a name="line.66"></a>
+<span class="sourceLineNo">067</span><a name="line.67"></a>
+<span class="sourceLineNo">068</span>        return NumberFactory.makeByteArray(s);<a name="line.68"></a>
+<span class="sourceLineNo">069</span>    }<a name="line.69"></a>
+<span class="sourceLineNo">070</span><a name="line.70"></a>
+<span class="sourceLineNo">071</span>    /** {@inheritDoc} */<a name="line.71"></a>
+<span class="sourceLineNo">072</span>    @Override<a name="line.72"></a>
+<span class="sourceLineNo">073</span>    protected void setStateInternal(byte[] s) {<a name="line.73"></a>
+<span class="sourceLineNo">074</span>        checkStateSize(s, (SEED_SIZE + 1) * 4);<a name="line.74"></a>
+<span class="sourceLineNo">075</span><a name="line.75"></a>
+<span class="sourceLineNo">076</span>        final int[] tmp = NumberFactory.makeIntArray(s);<a name="line.76"></a>
+<span class="sourceLineNo">077</span><a name="line.77"></a>
+<span class="sourceLineNo">078</span>        System.arraycopy(tmp, 0, state, 0, Q_SIZE);<a name="line.78"></a>
+<span class="sourceLineNo">079</span>        carry = tmp[SEED_SIZE - 1];<a name="line.79"></a>
+<span class="sourceLineNo">080</span>        index = tmp[SEED_SIZE];<a name="line.80"></a>
+<span class="sourceLineNo">081</span>    }<a name="line.81"></a>
+<span class="sourceLineNo">082</span><a name="line.82"></a>
+<span class="sourceLineNo">083</span>    /**<a name="line.83"></a>
+<span class="sourceLineNo">084</span>     * Seeds the RNG.<a name="line.84"></a>
+<span class="sourceLineNo">085</span>     *<a name="line.85"></a>
+<span class="sourceLineNo">086</span>     * @param seed Seed.<a name="line.86"></a>
+<span class="sourceLineNo">087</span>     */<a name="line.87"></a>
+<span class="sourceLineNo">088</span>    private void setSeedInternal(int[] seed) {<a name="line.88"></a>
+<span class="sourceLineNo">089</span>        // Reset the whole state of this RNG (i.e. "state" and "index").<a name="line.89"></a>
+<span class="sourceLineNo">090</span>        // Seeding procedure is not part of the reference code.<a name="line.90"></a>
 <span class="sourceLineNo">091</span>        final int[] tmp = new int[SEED_SIZE];<a name="line.91"></a>
-<span class="sourceLineNo">092</span>        System.arraycopy(seed, 0, tmp, 0, Math.min(seed.length, tmp.length));<a name="line.92"></a>
+<span class="sourceLineNo">092</span>        SeedFactory.fillState(tmp, seed);<a name="line.92"></a>
 <span class="sourceLineNo">093</span><a name="line.93"></a>
-<span class="sourceLineNo">094</span>        if (seed.length &lt; SEED_SIZE) {<a name="line.94"></a>
-<span class="sourceLineNo">095</span>            for (int i = seed.length; i &lt; SEED_SIZE; i++) {<a name="line.95"></a>
-<span class="sourceLineNo">096</span>                tmp[i] = 26021969 * i;<a name="line.96"></a>
-<span class="sourceLineNo">097</span>            }<a name="line.97"></a>
-<span class="sourceLineNo">098</span>            for (int i = SEED_SIZE - 1; i &gt; seed.length; i--) {<a name="line.98"></a>
-<span class="sourceLineNo">099</span>                tmp[i] ^= tmp[SEED_SIZE - i - 1];<a name="line.99"></a>
-<span class="sourceLineNo">100</span>            }<a name="line.100"></a>
+<span class="sourceLineNo">094</span>        // First element of the "seed" is the initial "carry".<a name="line.94"></a>
+<span class="sourceLineNo">095</span>        final int c = tmp[0];<a name="line.95"></a>
+<span class="sourceLineNo">096</span>        // Marsaglia's recommendation: 0 &lt;= carry &lt; A.<a name="line.96"></a>
+<span class="sourceLineNo">097</span>        carry = (int) ((c &lt; 0 ? -c : c) % A);<a name="line.97"></a>
+<span class="sourceLineNo">098</span><a name="line.98"></a>
+<span class="sourceLineNo">099</span>        // Initial state.<a name="line.99"></a>
+<span class="sourceLineNo">100</span>        System.arraycopy(tmp, 1, state, 0, Q_SIZE);<a name="line.100"></a>
 <span class="sourceLineNo">101</span><a name="line.101"></a>
-<span class="sourceLineNo">102</span>            tmp[seed.length] = 0x80000000; // Ensuring non-zero initial array.<a name="line.102"></a>
-<span class="sourceLineNo">103</span>        }<a name="line.103"></a>
-<span class="sourceLineNo">104</span><a name="line.104"></a>
-<span class="sourceLineNo">105</span>        // First element of the "seed" is the initial "carry".<a name="line.105"></a>
-<span class="sourceLineNo">106</span>        final int c = tmp[0];<a name="line.106"></a>
-<span class="sourceLineNo">107</span>        // Marsaglia's recommendation: 0 &lt;= carry &lt; A.<a name="line.107"></a>
-<span class="sourceLineNo">108</span>        carry = (int) ((c &lt; 0 ? -c : c) % A);<a name="line.108"></a>
-<span class="sourceLineNo">109</span><a name="line.109"></a>
-<span class="sourceLineNo">110</span>        // Initial state.<a name="line.110"></a>
-<span class="sourceLineNo">111</span>        System.arraycopy(tmp, 1, state, 0, Q_SIZE);<a name="line.111"></a>
-<span class="sourceLineNo">112</span><a name="line.112"></a>
-<span class="sourceLineNo">113</span>        // Initial index.<a name="line.113"></a>
-<span class="sourceLineNo">114</span>        index = Q_SIZE;<a name="line.114"></a>
-<span class="sourceLineNo">115</span>    }<a name="line.115"></a>
+<span class="sourceLineNo">102</span>        // Initial index.<a name="line.102"></a>
+<span class="sourceLineNo">103</span>        index = Q_SIZE;<a name="line.103"></a>
+<span class="sourceLineNo">104</span>    }<a name="line.104"></a>
+<span class="sourceLineNo">105</span><a name="line.105"></a>
+<span class="sourceLineNo">106</span>    /** {@inheritDoc} */<a name="line.106"></a>
+<span class="sourceLineNo">107</span>    @Override<a name="line.107"></a>
+<span class="sourceLineNo">108</span>    public int next() {<a name="line.108"></a>
+<span class="sourceLineNo">109</span>        if (index == Q_SIZE) { // Whole state used up.<a name="line.109"></a>
+<span class="sourceLineNo">110</span>            // Refill.<a name="line.110"></a>
+<span class="sourceLineNo">111</span>            for (int i = 0; i &lt; Q_SIZE; i++) {<a name="line.111"></a>
+<span class="sourceLineNo">112</span>                final long t = A * (state[i] &amp; 0xffffffffL) + carry;<a name="line.112"></a>
+<span class="sourceLineNo">113</span>                carry = (int) (t &gt;&gt; 32);<a name="line.113"></a>
+<span class="sourceLineNo">114</span>                state[i] = (int) t;<a name="line.114"></a>
+<span class="sourceLineNo">115</span>            }<a name="line.115"></a>
 <span class="sourceLineNo">116</span><a name="line.116"></a>
-<span class="sourceLineNo">117</span>    /** {@inheritDoc} */<a name="line.117"></a>
-<span class="sourceLineNo">118</span>    @Override<a name="line.118"></a>
-<span class="sourceLineNo">119</span>    public int next() {<a name="line.119"></a>
-<span class="sourceLineNo">120</span>        if (index == Q_SIZE) { // Whole state used up.<a name="line.120"></a>
-<span class="sourceLineNo">121</span>            // Refill.<a name="line.121"></a>
-<span class="sourceLineNo">122</span>            for (int i = 0; i &lt; Q_SIZE; i++) {<a name="line.122"></a>
-<span class="sourceLineNo">123</span>                final long t = A * (state[i] &amp; 0xffffffffL) + carry;<a name="line.123"></a>
-<span class="sourceLineNo">124</span>                carry = (int) (t &gt;&gt; 32);<a name="line.124"></a>
-<span class="sourceLineNo">125</span>                state[i] = (int) t;<a name="line.125"></a>
-<span class="sourceLineNo">126</span>            }<a name="line.126"></a>
-<span class="sourceLineNo">127</span><a name="line.127"></a>
-<span class="sourceLineNo">128</span>            // Reset current index.<a name="line.128"></a>
-<span class="sourceLineNo">129</span>            index = 0;<a name="line.129"></a>
-<span class="sourceLineNo">130</span>        }<a name="line.130"></a>
-<span class="sourceLineNo">131</span><a name="line.131"></a>
-<span class="sourceLineNo">132</span>        return state[index++];<a name="line.132"></a>
-<span class="sourceLineNo">133</span>    }<a name="line.133"></a>
-<span class="sourceLineNo">134</span>}<a name="line.134"></a>
+<span class="sourceLineNo">117</span>            // Reset current index.<a name="line.117"></a>
+<span class="sourceLineNo">118</span>            index = 0;<a name="line.118"></a>
+<span class="sourceLineNo">119</span>        }<a name="line.119"></a>
+<span class="sourceLineNo">120</span><a name="line.120"></a>
+<span class="sourceLineNo">121</span>        return state[index++];<a name="line.121"></a>
+<span class="sourceLineNo">122</span>    }<a name="line.122"></a>
+<span class="sourceLineNo">123</span>}<a name="line.123"></a>
 
 
 

Modified: websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/RandomIntSource.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/RandomIntSource.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/RandomIntSource.html Sat Sep 10 14:26:30 2016
@@ -26,7 +26,7 @@
 <span class="sourceLineNo">018</span>package org.apache.commons.rng.internal.source32;<a name="line.18"></a>
 <span class="sourceLineNo">019</span><a name="line.19"></a>
 <span class="sourceLineNo">020</span>/**<a name="line.20"></a>
-<span class="sourceLineNo">021</span> * Source of randomness that generate values of type {@code int}.<a name="line.21"></a>
+<span class="sourceLineNo">021</span> * Source of randomness that generates values of type {@code int}.<a name="line.21"></a>
 <span class="sourceLineNo">022</span> *<a name="line.22"></a>
 <span class="sourceLineNo">023</span> * @since 1.0<a name="line.23"></a>
 <span class="sourceLineNo">024</span> */<a name="line.24"></a>




Mime
View raw message