commons-notifications mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From er...@apache.org
Subject svn commit: r996528 [10/35] - in /websites/production/commons/content/proper/commons-rng: ./ apidocs/ apidocs/org/apache/commons/rng/ apidocs/org/apache/commons/rng/class-use/ apidocs/org/apache/commons/rng/internal/ apidocs/org/apache/commons/rng/inte...
Date Fri, 02 Sep 2016 16:37:59 GMT
Modified: websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/AbstractWell.IndexTable.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/AbstractWell.IndexTable.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/AbstractWell.IndexTable.html Fri Sep  2 16:37:56 2016
@@ -89,127 +89,124 @@
 <span class="sourceLineNo">081</span>    /**<a name="line.81"></a>
 <span class="sourceLineNo">082</span>     * Initializes the generator with the given {@code seed}.<a name="line.82"></a>
 <span class="sourceLineNo">083</span>     *<a name="line.83"></a>
-<span class="sourceLineNo">084</span>     * &lt;p&gt;The state of the generator is exactly the same as a new generator built<a name="line.84"></a>
-<span class="sourceLineNo">085</span>     * with the same seed.&lt;/p&gt;<a name="line.85"></a>
-<span class="sourceLineNo">086</span>     *<a name="line.86"></a>
-<span class="sourceLineNo">087</span>     * @param seed Seed. Cannot be null.<a name="line.87"></a>
-<span class="sourceLineNo">088</span>     */<a name="line.88"></a>
-<span class="sourceLineNo">089</span>    private void setSeedInternal(final int[] seed) {<a name="line.89"></a>
-<span class="sourceLineNo">090</span>        System.arraycopy(seed, 0, v, 0, Math.min(seed.length, v.length));<a name="line.90"></a>
-<span class="sourceLineNo">091</span><a name="line.91"></a>
-<span class="sourceLineNo">092</span>        if (seed.length &lt; v.length) {<a name="line.92"></a>
-<span class="sourceLineNo">093</span>            for (int i = seed.length; i &lt; v.length; ++i) {<a name="line.93"></a>
-<span class="sourceLineNo">094</span>                final long current = v[i - seed.length];<a name="line.94"></a>
-<span class="sourceLineNo">095</span>                v[i] = (int) ((1812433253L * (current ^ (current &gt;&gt; 30)) + i) &amp; 0xffffffffL);<a name="line.95"></a>
-<span class="sourceLineNo">096</span>            }<a name="line.96"></a>
-<span class="sourceLineNo">097</span>        }<a name="line.97"></a>
+<span class="sourceLineNo">084</span>     * @param seed Seed. Cannot be null.<a name="line.84"></a>
+<span class="sourceLineNo">085</span>     */<a name="line.85"></a>
+<span class="sourceLineNo">086</span>    private void setSeedInternal(final int[] seed) {<a name="line.86"></a>
+<span class="sourceLineNo">087</span>        System.arraycopy(seed, 0, v, 0, Math.min(seed.length, v.length));<a name="line.87"></a>
+<span class="sourceLineNo">088</span><a name="line.88"></a>
+<span class="sourceLineNo">089</span>        if (seed.length &lt; v.length) {<a name="line.89"></a>
+<span class="sourceLineNo">090</span>            for (int i = seed.length; i &lt; v.length; ++i) {<a name="line.90"></a>
+<span class="sourceLineNo">091</span>                final long current = v[i - seed.length];<a name="line.91"></a>
+<span class="sourceLineNo">092</span>                v[i] = (int) ((1812433253L * (current ^ (current &gt;&gt; 30)) + i) &amp; 0xffffffffL);<a name="line.92"></a>
+<span class="sourceLineNo">093</span>            }<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>        index = 0;<a name="line.96"></a>
+<span class="sourceLineNo">097</span>    }<a name="line.97"></a>
 <span class="sourceLineNo">098</span><a name="line.98"></a>
-<span class="sourceLineNo">099</span>        index = 0;<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>    /**<a name="line.102"></a>
-<span class="sourceLineNo">103</span>     * Calculate the number of 32-bits blocks.<a name="line.103"></a>
-<span class="sourceLineNo">104</span>     *<a name="line.104"></a>
-<span class="sourceLineNo">105</span>     * @param k Number of bits in the pool (not necessarily a multiple of 32).<a name="line.105"></a>
-<span class="sourceLineNo">106</span>     * @return the number of 32-bits blocks.<a name="line.106"></a>
-<span class="sourceLineNo">107</span>     */<a name="line.107"></a>
-<span class="sourceLineNo">108</span>    private static int calculateBlockCount(final int k) {<a name="line.108"></a>
-<span class="sourceLineNo">109</span>        // the bits pool contains k bits, k = r w - p where r is the number<a name="line.109"></a>
-<span class="sourceLineNo">110</span>        // of w bits blocks, w is the block size (always 32 in the original paper)<a name="line.110"></a>
-<span class="sourceLineNo">111</span>        // and p is the number of unused bits in the last block<a name="line.111"></a>
-<span class="sourceLineNo">112</span>        final int w = 32;<a name="line.112"></a>
-<span class="sourceLineNo">113</span>        final int r = (k + w - 1) / w;<a name="line.113"></a>
-<span class="sourceLineNo">114</span>        return r;<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>    /**<a name="line.117"></a>
-<span class="sourceLineNo">118</span>     * Inner class used to store the indirection index table which is fixed for a given<a name="line.118"></a>
-<span class="sourceLineNo">119</span>     * type of WELL class of pseudo-random number generator.<a name="line.119"></a>
-<span class="sourceLineNo">120</span>     */<a name="line.120"></a>
-<span class="sourceLineNo">121</span>    protected static final class IndexTable {<a name="line.121"></a>
-<span class="sourceLineNo">122</span>        /** Index indirection table giving for each index its predecessor taking table size into account. */<a name="line.122"></a>
-<span class="sourceLineNo">123</span>        private final int[] iRm1;<a name="line.123"></a>
-<span class="sourceLineNo">124</span>        /** Index indirection table giving for each index its second predecessor taking table size into account. */<a name="line.124"></a>
-<span class="sourceLineNo">125</span>        private final int[] iRm2;<a name="line.125"></a>
-<span class="sourceLineNo">126</span>        /** Index indirection table giving for each index the value index + m1 taking table size into account. */<a name="line.126"></a>
-<span class="sourceLineNo">127</span>        private final int[] i1;<a name="line.127"></a>
-<span class="sourceLineNo">128</span>        /** Index indirection table giving for each index the value index + m2 taking table size into account. */<a name="line.128"></a>
-<span class="sourceLineNo">129</span>        private final int[] i2;<a name="line.129"></a>
-<span class="sourceLineNo">130</span>        /** Index indirection table giving for each index the value index + m3 taking table size into account. */<a name="line.130"></a>
-<span class="sourceLineNo">131</span>        private final int[] i3;<a name="line.131"></a>
-<span class="sourceLineNo">132</span><a name="line.132"></a>
-<span class="sourceLineNo">133</span>        /** Creates a new pre-calculated indirection index table.<a name="line.133"></a>
-<span class="sourceLineNo">134</span>         * @param k number of bits in the pool (not necessarily a multiple of 32)<a name="line.134"></a>
-<span class="sourceLineNo">135</span>         * @param m1 first parameter of the algorithm<a name="line.135"></a>
-<span class="sourceLineNo">136</span>         * @param m2 second parameter of the algorithm<a name="line.136"></a>
-<span class="sourceLineNo">137</span>         * @param m3 third parameter of the algorithm<a name="line.137"></a>
-<span class="sourceLineNo">138</span>         */<a name="line.138"></a>
-<span class="sourceLineNo">139</span>        public IndexTable(final int k, final int m1, final int m2, final int m3) {<a name="line.139"></a>
-<span class="sourceLineNo">140</span><a name="line.140"></a>
-<span class="sourceLineNo">141</span>            final int r = calculateBlockCount(k);<a name="line.141"></a>
-<span class="sourceLineNo">142</span><a name="line.142"></a>
-<span class="sourceLineNo">143</span>            // precompute indirection index tables. These tables are used for optimizing access<a name="line.143"></a>
-<span class="sourceLineNo">144</span>            // they allow saving computations like "(j + r - 2) % r" with costly modulo operations<a name="line.144"></a>
-<span class="sourceLineNo">145</span>            iRm1 = new int[r];<a name="line.145"></a>
-<span class="sourceLineNo">146</span>            iRm2 = new int[r];<a name="line.146"></a>
-<span class="sourceLineNo">147</span>            i1 = new int[r];<a name="line.147"></a>
-<span class="sourceLineNo">148</span>            i2 = new int[r];<a name="line.148"></a>
-<span class="sourceLineNo">149</span>            i3 = new int[r];<a name="line.149"></a>
-<span class="sourceLineNo">150</span>            for (int j = 0; j &lt; r; ++j) {<a name="line.150"></a>
-<span class="sourceLineNo">151</span>                iRm1[j] = (j + r - 1) % r;<a name="line.151"></a>
-<span class="sourceLineNo">152</span>                iRm2[j] = (j + r - 2) % r;<a name="line.152"></a>
-<span class="sourceLineNo">153</span>                i1[j] = (j + m1) % r;<a name="line.153"></a>
-<span class="sourceLineNo">154</span>                i2[j] = (j + m2) % r;<a name="line.154"></a>
-<span class="sourceLineNo">155</span>                i3[j] = (j + m3) % r;<a name="line.155"></a>
-<span class="sourceLineNo">156</span>            }<a name="line.156"></a>
-<span class="sourceLineNo">157</span>        }<a name="line.157"></a>
-<span class="sourceLineNo">158</span><a name="line.158"></a>
-<span class="sourceLineNo">159</span>        /**<a name="line.159"></a>
-<span class="sourceLineNo">160</span>         * Returns the predecessor of the given index modulo the table size.<a name="line.160"></a>
-<span class="sourceLineNo">161</span>         * @param index the index to look at<a name="line.161"></a>
-<span class="sourceLineNo">162</span>         * @return (index - 1) % table size<a name="line.162"></a>
-<span class="sourceLineNo">163</span>         */<a name="line.163"></a>
-<span class="sourceLineNo">164</span>        public int getIndexPred(final int index) {<a name="line.164"></a>
-<span class="sourceLineNo">165</span>            return iRm1[index];<a name="line.165"></a>
-<span class="sourceLineNo">166</span>        }<a name="line.166"></a>
-<span class="sourceLineNo">167</span><a name="line.167"></a>
-<span class="sourceLineNo">168</span>        /**<a name="line.168"></a>
-<span class="sourceLineNo">169</span>         * Returns the second predecessor of the given index modulo the table size.<a name="line.169"></a>
-<span class="sourceLineNo">170</span>         * @param index the index to look at<a name="line.170"></a>
-<span class="sourceLineNo">171</span>         * @return (index - 2) % table size<a name="line.171"></a>
-<span class="sourceLineNo">172</span>         */<a name="line.172"></a>
-<span class="sourceLineNo">173</span>        public int getIndexPred2(final int index) {<a name="line.173"></a>
-<span class="sourceLineNo">174</span>            return iRm2[index];<a name="line.174"></a>
-<span class="sourceLineNo">175</span>        }<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>         * Returns index + M1 modulo the table size.<a name="line.178"></a>
-<span class="sourceLineNo">179</span>         * @param index the index to look at<a name="line.179"></a>
-<span class="sourceLineNo">180</span>         * @return (index + M1) % table size<a name="line.180"></a>
-<span class="sourceLineNo">181</span>         */<a name="line.181"></a>
-<span class="sourceLineNo">182</span>        public int getIndexM1(final int index) {<a name="line.182"></a>
-<span class="sourceLineNo">183</span>            return i1[index];<a name="line.183"></a>
-<span class="sourceLineNo">184</span>        }<a name="line.184"></a>
-<span class="sourceLineNo">185</span><a name="line.185"></a>
-<span class="sourceLineNo">186</span>        /**<a name="line.186"></a>
-<span class="sourceLineNo">187</span>         * Returns index + M2 modulo the table size.<a name="line.187"></a>
-<span class="sourceLineNo">188</span>         * @param index the index to look at<a name="line.188"></a>
-<span class="sourceLineNo">189</span>         * @return (index + M2) % table size<a name="line.189"></a>
-<span class="sourceLineNo">190</span>         */<a name="line.190"></a>
-<span class="sourceLineNo">191</span>        public int getIndexM2(final int index) {<a name="line.191"></a>
-<span class="sourceLineNo">192</span>            return i2[index];<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>         * Returns index + M3 modulo the table size.<a name="line.196"></a>
-<span class="sourceLineNo">197</span>         * @param index the index to look at<a name="line.197"></a>
-<span class="sourceLineNo">198</span>         * @return (index + M3) % table size<a name="line.198"></a>
-<span class="sourceLineNo">199</span>         */<a name="line.199"></a>
-<span class="sourceLineNo">200</span>        public int getIndexM3(final int index) {<a name="line.200"></a>
-<span class="sourceLineNo">201</span>            return i3[index];<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">099</span>    /**<a name="line.99"></a>
+<span class="sourceLineNo">100</span>     * Calculate the number of 32-bits blocks.<a name="line.100"></a>
+<span class="sourceLineNo">101</span>     *<a name="line.101"></a>
+<span class="sourceLineNo">102</span>     * @param k Number of bits in the pool (not necessarily a multiple of 32).<a name="line.102"></a>
+<span class="sourceLineNo">103</span>     * @return the number of 32-bits blocks.<a name="line.103"></a>
+<span class="sourceLineNo">104</span>     */<a name="line.104"></a>
+<span class="sourceLineNo">105</span>    private static int calculateBlockCount(final int k) {<a name="line.105"></a>
+<span class="sourceLineNo">106</span>        // the bits pool contains k bits, k = r w - p where r is the number<a name="line.106"></a>
+<span class="sourceLineNo">107</span>        // of w bits blocks, w is the block size (always 32 in the original paper)<a name="line.107"></a>
+<span class="sourceLineNo">108</span>        // and p is the number of unused bits in the last block<a name="line.108"></a>
+<span class="sourceLineNo">109</span>        final int w = 32;<a name="line.109"></a>
+<span class="sourceLineNo">110</span>        final int r = (k + w - 1) / w;<a name="line.110"></a>
+<span class="sourceLineNo">111</span>        return r;<a name="line.111"></a>
+<span class="sourceLineNo">112</span>    }<a name="line.112"></a>
+<span class="sourceLineNo">113</span><a name="line.113"></a>
+<span class="sourceLineNo">114</span>    /**<a name="line.114"></a>
+<span class="sourceLineNo">115</span>     * Inner class used to store the indirection index table which is fixed for a given<a name="line.115"></a>
+<span class="sourceLineNo">116</span>     * type of WELL class of pseudo-random number generator.<a name="line.116"></a>
+<span class="sourceLineNo">117</span>     */<a name="line.117"></a>
+<span class="sourceLineNo">118</span>    protected static final class IndexTable {<a name="line.118"></a>
+<span class="sourceLineNo">119</span>        /** Index indirection table giving for each index its predecessor taking table size into account. */<a name="line.119"></a>
+<span class="sourceLineNo">120</span>        private final int[] iRm1;<a name="line.120"></a>
+<span class="sourceLineNo">121</span>        /** Index indirection table giving for each index its second predecessor taking table size into account. */<a name="line.121"></a>
+<span class="sourceLineNo">122</span>        private final int[] iRm2;<a name="line.122"></a>
+<span class="sourceLineNo">123</span>        /** Index indirection table giving for each index the value index + m1 taking table size into account. */<a name="line.123"></a>
+<span class="sourceLineNo">124</span>        private final int[] i1;<a name="line.124"></a>
+<span class="sourceLineNo">125</span>        /** Index indirection table giving for each index the value index + m2 taking table size into account. */<a name="line.125"></a>
+<span class="sourceLineNo">126</span>        private final int[] i2;<a name="line.126"></a>
+<span class="sourceLineNo">127</span>        /** Index indirection table giving for each index the value index + m3 taking table size into account. */<a name="line.127"></a>
+<span class="sourceLineNo">128</span>        private final int[] i3;<a name="line.128"></a>
+<span class="sourceLineNo">129</span><a name="line.129"></a>
+<span class="sourceLineNo">130</span>        /** Creates a new pre-calculated indirection index table.<a name="line.130"></a>
+<span class="sourceLineNo">131</span>         * @param k number of bits in the pool (not necessarily a multiple of 32)<a name="line.131"></a>
+<span class="sourceLineNo">132</span>         * @param m1 first parameter of the algorithm<a name="line.132"></a>
+<span class="sourceLineNo">133</span>         * @param m2 second parameter of the algorithm<a name="line.133"></a>
+<span class="sourceLineNo">134</span>         * @param m3 third parameter of the algorithm<a name="line.134"></a>
+<span class="sourceLineNo">135</span>         */<a name="line.135"></a>
+<span class="sourceLineNo">136</span>        public IndexTable(final int k, final int m1, final int m2, final int m3) {<a name="line.136"></a>
+<span class="sourceLineNo">137</span><a name="line.137"></a>
+<span class="sourceLineNo">138</span>            final int r = calculateBlockCount(k);<a name="line.138"></a>
+<span class="sourceLineNo">139</span><a name="line.139"></a>
+<span class="sourceLineNo">140</span>            // precompute indirection index tables. These tables are used for optimizing access<a name="line.140"></a>
+<span class="sourceLineNo">141</span>            // they allow saving computations like "(j + r - 2) % r" with costly modulo operations<a name="line.141"></a>
+<span class="sourceLineNo">142</span>            iRm1 = new int[r];<a name="line.142"></a>
+<span class="sourceLineNo">143</span>            iRm2 = new int[r];<a name="line.143"></a>
+<span class="sourceLineNo">144</span>            i1 = new int[r];<a name="line.144"></a>
+<span class="sourceLineNo">145</span>            i2 = new int[r];<a name="line.145"></a>
+<span class="sourceLineNo">146</span>            i3 = new int[r];<a name="line.146"></a>
+<span class="sourceLineNo">147</span>            for (int j = 0; j &lt; r; ++j) {<a name="line.147"></a>
+<span class="sourceLineNo">148</span>                iRm1[j] = (j + r - 1) % r;<a name="line.148"></a>
+<span class="sourceLineNo">149</span>                iRm2[j] = (j + r - 2) % r;<a name="line.149"></a>
+<span class="sourceLineNo">150</span>                i1[j] = (j + m1) % r;<a name="line.150"></a>
+<span class="sourceLineNo">151</span>                i2[j] = (j + m2) % r;<a name="line.151"></a>
+<span class="sourceLineNo">152</span>                i3[j] = (j + m3) % r;<a name="line.152"></a>
+<span class="sourceLineNo">153</span>            }<a name="line.153"></a>
+<span class="sourceLineNo">154</span>        }<a name="line.154"></a>
+<span class="sourceLineNo">155</span><a name="line.155"></a>
+<span class="sourceLineNo">156</span>        /**<a name="line.156"></a>
+<span class="sourceLineNo">157</span>         * Returns the predecessor of the given index modulo the table size.<a name="line.157"></a>
+<span class="sourceLineNo">158</span>         * @param index the index to look at<a name="line.158"></a>
+<span class="sourceLineNo">159</span>         * @return (index - 1) % table size<a name="line.159"></a>
+<span class="sourceLineNo">160</span>         */<a name="line.160"></a>
+<span class="sourceLineNo">161</span>        public int getIndexPred(final int index) {<a name="line.161"></a>
+<span class="sourceLineNo">162</span>            return iRm1[index];<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>        /**<a name="line.165"></a>
+<span class="sourceLineNo">166</span>         * Returns the second predecessor of the given index modulo the table size.<a name="line.166"></a>
+<span class="sourceLineNo">167</span>         * @param index the index to look at<a name="line.167"></a>
+<span class="sourceLineNo">168</span>         * @return (index - 2) % table size<a name="line.168"></a>
+<span class="sourceLineNo">169</span>         */<a name="line.169"></a>
+<span class="sourceLineNo">170</span>        public int getIndexPred2(final int index) {<a name="line.170"></a>
+<span class="sourceLineNo">171</span>            return iRm2[index];<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>        /**<a name="line.174"></a>
+<span class="sourceLineNo">175</span>         * Returns index + M1 modulo the table size.<a name="line.175"></a>
+<span class="sourceLineNo">176</span>         * @param index the index to look at<a name="line.176"></a>
+<span class="sourceLineNo">177</span>         * @return (index + M1) % table size<a name="line.177"></a>
+<span class="sourceLineNo">178</span>         */<a name="line.178"></a>
+<span class="sourceLineNo">179</span>        public int getIndexM1(final int index) {<a name="line.179"></a>
+<span class="sourceLineNo">180</span>            return i1[index];<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>        /**<a name="line.183"></a>
+<span class="sourceLineNo">184</span>         * Returns index + M2 modulo the table size.<a name="line.184"></a>
+<span class="sourceLineNo">185</span>         * @param index the index to look at<a name="line.185"></a>
+<span class="sourceLineNo">186</span>         * @return (index + M2) % table size<a name="line.186"></a>
+<span class="sourceLineNo">187</span>         */<a name="line.187"></a>
+<span class="sourceLineNo">188</span>        public int getIndexM2(final int index) {<a name="line.188"></a>
+<span class="sourceLineNo">189</span>            return i2[index];<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>         * Returns index + M3 modulo the table size.<a name="line.193"></a>
+<span class="sourceLineNo">194</span>         * @param index the index to look at<a name="line.194"></a>
+<span class="sourceLineNo">195</span>         * @return (index + M3) % table size<a name="line.195"></a>
+<span class="sourceLineNo">196</span>         */<a name="line.196"></a>
+<span class="sourceLineNo">197</span>        public int getIndexM3(final int index) {<a name="line.197"></a>
+<span class="sourceLineNo">198</span>            return i3[index];<a name="line.198"></a>
+<span class="sourceLineNo">199</span>        }<a name="line.199"></a>
+<span class="sourceLineNo">200</span>    }<a name="line.200"></a>
+<span class="sourceLineNo">201</span>}<a name="line.201"></a>
 
 
 

Modified: websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/AbstractWell.html
==============================================================================
--- websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/AbstractWell.html (original)
+++ websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/AbstractWell.html Fri Sep  2 16:37:56 2016
@@ -89,127 +89,124 @@
 <span class="sourceLineNo">081</span>    /**<a name="line.81"></a>
 <span class="sourceLineNo">082</span>     * Initializes the generator with the given {@code seed}.<a name="line.82"></a>
 <span class="sourceLineNo">083</span>     *<a name="line.83"></a>
-<span class="sourceLineNo">084</span>     * &lt;p&gt;The state of the generator is exactly the same as a new generator built<a name="line.84"></a>
-<span class="sourceLineNo">085</span>     * with the same seed.&lt;/p&gt;<a name="line.85"></a>
-<span class="sourceLineNo">086</span>     *<a name="line.86"></a>
-<span class="sourceLineNo">087</span>     * @param seed Seed. Cannot be null.<a name="line.87"></a>
-<span class="sourceLineNo">088</span>     */<a name="line.88"></a>
-<span class="sourceLineNo">089</span>    private void setSeedInternal(final int[] seed) {<a name="line.89"></a>
-<span class="sourceLineNo">090</span>        System.arraycopy(seed, 0, v, 0, Math.min(seed.length, v.length));<a name="line.90"></a>
-<span class="sourceLineNo">091</span><a name="line.91"></a>
-<span class="sourceLineNo">092</span>        if (seed.length &lt; v.length) {<a name="line.92"></a>
-<span class="sourceLineNo">093</span>            for (int i = seed.length; i &lt; v.length; ++i) {<a name="line.93"></a>
-<span class="sourceLineNo">094</span>                final long current = v[i - seed.length];<a name="line.94"></a>
-<span class="sourceLineNo">095</span>                v[i] = (int) ((1812433253L * (current ^ (current &gt;&gt; 30)) + i) &amp; 0xffffffffL);<a name="line.95"></a>
-<span class="sourceLineNo">096</span>            }<a name="line.96"></a>
-<span class="sourceLineNo">097</span>        }<a name="line.97"></a>
+<span class="sourceLineNo">084</span>     * @param seed Seed. Cannot be null.<a name="line.84"></a>
+<span class="sourceLineNo">085</span>     */<a name="line.85"></a>
+<span class="sourceLineNo">086</span>    private void setSeedInternal(final int[] seed) {<a name="line.86"></a>
+<span class="sourceLineNo">087</span>        System.arraycopy(seed, 0, v, 0, Math.min(seed.length, v.length));<a name="line.87"></a>
+<span class="sourceLineNo">088</span><a name="line.88"></a>
+<span class="sourceLineNo">089</span>        if (seed.length &lt; v.length) {<a name="line.89"></a>
+<span class="sourceLineNo">090</span>            for (int i = seed.length; i &lt; v.length; ++i) {<a name="line.90"></a>
+<span class="sourceLineNo">091</span>                final long current = v[i - seed.length];<a name="line.91"></a>
+<span class="sourceLineNo">092</span>                v[i] = (int) ((1812433253L * (current ^ (current &gt;&gt; 30)) + i) &amp; 0xffffffffL);<a name="line.92"></a>
+<span class="sourceLineNo">093</span>            }<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>        index = 0;<a name="line.96"></a>
+<span class="sourceLineNo">097</span>    }<a name="line.97"></a>
 <span class="sourceLineNo">098</span><a name="line.98"></a>
-<span class="sourceLineNo">099</span>        index = 0;<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>    /**<a name="line.102"></a>
-<span class="sourceLineNo">103</span>     * Calculate the number of 32-bits blocks.<a name="line.103"></a>
-<span class="sourceLineNo">104</span>     *<a name="line.104"></a>
-<span class="sourceLineNo">105</span>     * @param k Number of bits in the pool (not necessarily a multiple of 32).<a name="line.105"></a>
-<span class="sourceLineNo">106</span>     * @return the number of 32-bits blocks.<a name="line.106"></a>
-<span class="sourceLineNo">107</span>     */<a name="line.107"></a>
-<span class="sourceLineNo">108</span>    private static int calculateBlockCount(final int k) {<a name="line.108"></a>
-<span class="sourceLineNo">109</span>        // the bits pool contains k bits, k = r w - p where r is the number<a name="line.109"></a>
-<span class="sourceLineNo">110</span>        // of w bits blocks, w is the block size (always 32 in the original paper)<a name="line.110"></a>
-<span class="sourceLineNo">111</span>        // and p is the number of unused bits in the last block<a name="line.111"></a>
-<span class="sourceLineNo">112</span>        final int w = 32;<a name="line.112"></a>
-<span class="sourceLineNo">113</span>        final int r = (k + w - 1) / w;<a name="line.113"></a>
-<span class="sourceLineNo">114</span>        return r;<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>    /**<a name="line.117"></a>
-<span class="sourceLineNo">118</span>     * Inner class used to store the indirection index table which is fixed for a given<a name="line.118"></a>
-<span class="sourceLineNo">119</span>     * type of WELL class of pseudo-random number generator.<a name="line.119"></a>
-<span class="sourceLineNo">120</span>     */<a name="line.120"></a>
-<span class="sourceLineNo">121</span>    protected static final class IndexTable {<a name="line.121"></a>
-<span class="sourceLineNo">122</span>        /** Index indirection table giving for each index its predecessor taking table size into account. */<a name="line.122"></a>
-<span class="sourceLineNo">123</span>        private final int[] iRm1;<a name="line.123"></a>
-<span class="sourceLineNo">124</span>        /** Index indirection table giving for each index its second predecessor taking table size into account. */<a name="line.124"></a>
-<span class="sourceLineNo">125</span>        private final int[] iRm2;<a name="line.125"></a>
-<span class="sourceLineNo">126</span>        /** Index indirection table giving for each index the value index + m1 taking table size into account. */<a name="line.126"></a>
-<span class="sourceLineNo">127</span>        private final int[] i1;<a name="line.127"></a>
-<span class="sourceLineNo">128</span>        /** Index indirection table giving for each index the value index + m2 taking table size into account. */<a name="line.128"></a>
-<span class="sourceLineNo">129</span>        private final int[] i2;<a name="line.129"></a>
-<span class="sourceLineNo">130</span>        /** Index indirection table giving for each index the value index + m3 taking table size into account. */<a name="line.130"></a>
-<span class="sourceLineNo">131</span>        private final int[] i3;<a name="line.131"></a>
-<span class="sourceLineNo">132</span><a name="line.132"></a>
-<span class="sourceLineNo">133</span>        /** Creates a new pre-calculated indirection index table.<a name="line.133"></a>
-<span class="sourceLineNo">134</span>         * @param k number of bits in the pool (not necessarily a multiple of 32)<a name="line.134"></a>
-<span class="sourceLineNo">135</span>         * @param m1 first parameter of the algorithm<a name="line.135"></a>
-<span class="sourceLineNo">136</span>         * @param m2 second parameter of the algorithm<a name="line.136"></a>
-<span class="sourceLineNo">137</span>         * @param m3 third parameter of the algorithm<a name="line.137"></a>
-<span class="sourceLineNo">138</span>         */<a name="line.138"></a>
-<span class="sourceLineNo">139</span>        public IndexTable(final int k, final int m1, final int m2, final int m3) {<a name="line.139"></a>
-<span class="sourceLineNo">140</span><a name="line.140"></a>
-<span class="sourceLineNo">141</span>            final int r = calculateBlockCount(k);<a name="line.141"></a>
-<span class="sourceLineNo">142</span><a name="line.142"></a>
-<span class="sourceLineNo">143</span>            // precompute indirection index tables. These tables are used for optimizing access<a name="line.143"></a>
-<span class="sourceLineNo">144</span>            // they allow saving computations like "(j + r - 2) % r" with costly modulo operations<a name="line.144"></a>
-<span class="sourceLineNo">145</span>            iRm1 = new int[r];<a name="line.145"></a>
-<span class="sourceLineNo">146</span>            iRm2 = new int[r];<a name="line.146"></a>
-<span class="sourceLineNo">147</span>            i1 = new int[r];<a name="line.147"></a>
-<span class="sourceLineNo">148</span>            i2 = new int[r];<a name="line.148"></a>
-<span class="sourceLineNo">149</span>            i3 = new int[r];<a name="line.149"></a>
-<span class="sourceLineNo">150</span>            for (int j = 0; j &lt; r; ++j) {<a name="line.150"></a>
-<span class="sourceLineNo">151</span>                iRm1[j] = (j + r - 1) % r;<a name="line.151"></a>
-<span class="sourceLineNo">152</span>                iRm2[j] = (j + r - 2) % r;<a name="line.152"></a>
-<span class="sourceLineNo">153</span>                i1[j] = (j + m1) % r;<a name="line.153"></a>
-<span class="sourceLineNo">154</span>                i2[j] = (j + m2) % r;<a name="line.154"></a>
-<span class="sourceLineNo">155</span>                i3[j] = (j + m3) % r;<a name="line.155"></a>
-<span class="sourceLineNo">156</span>            }<a name="line.156"></a>
-<span class="sourceLineNo">157</span>        }<a name="line.157"></a>
-<span class="sourceLineNo">158</span><a name="line.158"></a>
-<span class="sourceLineNo">159</span>        /**<a name="line.159"></a>
-<span class="sourceLineNo">160</span>         * Returns the predecessor of the given index modulo the table size.<a name="line.160"></a>
-<span class="sourceLineNo">161</span>         * @param index the index to look at<a name="line.161"></a>
-<span class="sourceLineNo">162</span>         * @return (index - 1) % table size<a name="line.162"></a>
-<span class="sourceLineNo">163</span>         */<a name="line.163"></a>
-<span class="sourceLineNo">164</span>        public int getIndexPred(final int index) {<a name="line.164"></a>
-<span class="sourceLineNo">165</span>            return iRm1[index];<a name="line.165"></a>
-<span class="sourceLineNo">166</span>        }<a name="line.166"></a>
-<span class="sourceLineNo">167</span><a name="line.167"></a>
-<span class="sourceLineNo">168</span>        /**<a name="line.168"></a>
-<span class="sourceLineNo">169</span>         * Returns the second predecessor of the given index modulo the table size.<a name="line.169"></a>
-<span class="sourceLineNo">170</span>         * @param index the index to look at<a name="line.170"></a>
-<span class="sourceLineNo">171</span>         * @return (index - 2) % table size<a name="line.171"></a>
-<span class="sourceLineNo">172</span>         */<a name="line.172"></a>
-<span class="sourceLineNo">173</span>        public int getIndexPred2(final int index) {<a name="line.173"></a>
-<span class="sourceLineNo">174</span>            return iRm2[index];<a name="line.174"></a>
-<span class="sourceLineNo">175</span>        }<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>         * Returns index + M1 modulo the table size.<a name="line.178"></a>
-<span class="sourceLineNo">179</span>         * @param index the index to look at<a name="line.179"></a>
-<span class="sourceLineNo">180</span>         * @return (index + M1) % table size<a name="line.180"></a>
-<span class="sourceLineNo">181</span>         */<a name="line.181"></a>
-<span class="sourceLineNo">182</span>        public int getIndexM1(final int index) {<a name="line.182"></a>
-<span class="sourceLineNo">183</span>            return i1[index];<a name="line.183"></a>
-<span class="sourceLineNo">184</span>        }<a name="line.184"></a>
-<span class="sourceLineNo">185</span><a name="line.185"></a>
-<span class="sourceLineNo">186</span>        /**<a name="line.186"></a>
-<span class="sourceLineNo">187</span>         * Returns index + M2 modulo the table size.<a name="line.187"></a>
-<span class="sourceLineNo">188</span>         * @param index the index to look at<a name="line.188"></a>
-<span class="sourceLineNo">189</span>         * @return (index + M2) % table size<a name="line.189"></a>
-<span class="sourceLineNo">190</span>         */<a name="line.190"></a>
-<span class="sourceLineNo">191</span>        public int getIndexM2(final int index) {<a name="line.191"></a>
-<span class="sourceLineNo">192</span>            return i2[index];<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>         * Returns index + M3 modulo the table size.<a name="line.196"></a>
-<span class="sourceLineNo">197</span>         * @param index the index to look at<a name="line.197"></a>
-<span class="sourceLineNo">198</span>         * @return (index + M3) % table size<a name="line.198"></a>
-<span class="sourceLineNo">199</span>         */<a name="line.199"></a>
-<span class="sourceLineNo">200</span>        public int getIndexM3(final int index) {<a name="line.200"></a>
-<span class="sourceLineNo">201</span>            return i3[index];<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">099</span>    /**<a name="line.99"></a>
+<span class="sourceLineNo">100</span>     * Calculate the number of 32-bits blocks.<a name="line.100"></a>
+<span class="sourceLineNo">101</span>     *<a name="line.101"></a>
+<span class="sourceLineNo">102</span>     * @param k Number of bits in the pool (not necessarily a multiple of 32).<a name="line.102"></a>
+<span class="sourceLineNo">103</span>     * @return the number of 32-bits blocks.<a name="line.103"></a>
+<span class="sourceLineNo">104</span>     */<a name="line.104"></a>
+<span class="sourceLineNo">105</span>    private static int calculateBlockCount(final int k) {<a name="line.105"></a>
+<span class="sourceLineNo">106</span>        // the bits pool contains k bits, k = r w - p where r is the number<a name="line.106"></a>
+<span class="sourceLineNo">107</span>        // of w bits blocks, w is the block size (always 32 in the original paper)<a name="line.107"></a>
+<span class="sourceLineNo">108</span>        // and p is the number of unused bits in the last block<a name="line.108"></a>
+<span class="sourceLineNo">109</span>        final int w = 32;<a name="line.109"></a>
+<span class="sourceLineNo">110</span>        final int r = (k + w - 1) / w;<a name="line.110"></a>
+<span class="sourceLineNo">111</span>        return r;<a name="line.111"></a>
+<span class="sourceLineNo">112</span>    }<a name="line.112"></a>
+<span class="sourceLineNo">113</span><a name="line.113"></a>
+<span class="sourceLineNo">114</span>    /**<a name="line.114"></a>
+<span class="sourceLineNo">115</span>     * Inner class used to store the indirection index table which is fixed for a given<a name="line.115"></a>
+<span class="sourceLineNo">116</span>     * type of WELL class of pseudo-random number generator.<a name="line.116"></a>
+<span class="sourceLineNo">117</span>     */<a name="line.117"></a>
+<span class="sourceLineNo">118</span>    protected static final class IndexTable {<a name="line.118"></a>
+<span class="sourceLineNo">119</span>        /** Index indirection table giving for each index its predecessor taking table size into account. */<a name="line.119"></a>
+<span class="sourceLineNo">120</span>        private final int[] iRm1;<a name="line.120"></a>
+<span class="sourceLineNo">121</span>        /** Index indirection table giving for each index its second predecessor taking table size into account. */<a name="line.121"></a>
+<span class="sourceLineNo">122</span>        private final int[] iRm2;<a name="line.122"></a>
+<span class="sourceLineNo">123</span>        /** Index indirection table giving for each index the value index + m1 taking table size into account. */<a name="line.123"></a>
+<span class="sourceLineNo">124</span>        private final int[] i1;<a name="line.124"></a>
+<span class="sourceLineNo">125</span>        /** Index indirection table giving for each index the value index + m2 taking table size into account. */<a name="line.125"></a>
+<span class="sourceLineNo">126</span>        private final int[] i2;<a name="line.126"></a>
+<span class="sourceLineNo">127</span>        /** Index indirection table giving for each index the value index + m3 taking table size into account. */<a name="line.127"></a>
+<span class="sourceLineNo">128</span>        private final int[] i3;<a name="line.128"></a>
+<span class="sourceLineNo">129</span><a name="line.129"></a>
+<span class="sourceLineNo">130</span>        /** Creates a new pre-calculated indirection index table.<a name="line.130"></a>
+<span class="sourceLineNo">131</span>         * @param k number of bits in the pool (not necessarily a multiple of 32)<a name="line.131"></a>
+<span class="sourceLineNo">132</span>         * @param m1 first parameter of the algorithm<a name="line.132"></a>
+<span class="sourceLineNo">133</span>         * @param m2 second parameter of the algorithm<a name="line.133"></a>
+<span class="sourceLineNo">134</span>         * @param m3 third parameter of the algorithm<a name="line.134"></a>
+<span class="sourceLineNo">135</span>         */<a name="line.135"></a>
+<span class="sourceLineNo">136</span>        public IndexTable(final int k, final int m1, final int m2, final int m3) {<a name="line.136"></a>
+<span class="sourceLineNo">137</span><a name="line.137"></a>
+<span class="sourceLineNo">138</span>            final int r = calculateBlockCount(k);<a name="line.138"></a>
+<span class="sourceLineNo">139</span><a name="line.139"></a>
+<span class="sourceLineNo">140</span>            // precompute indirection index tables. These tables are used for optimizing access<a name="line.140"></a>
+<span class="sourceLineNo">141</span>            // they allow saving computations like "(j + r - 2) % r" with costly modulo operations<a name="line.141"></a>
+<span class="sourceLineNo">142</span>            iRm1 = new int[r];<a name="line.142"></a>
+<span class="sourceLineNo">143</span>            iRm2 = new int[r];<a name="line.143"></a>
+<span class="sourceLineNo">144</span>            i1 = new int[r];<a name="line.144"></a>
+<span class="sourceLineNo">145</span>            i2 = new int[r];<a name="line.145"></a>
+<span class="sourceLineNo">146</span>            i3 = new int[r];<a name="line.146"></a>
+<span class="sourceLineNo">147</span>            for (int j = 0; j &lt; r; ++j) {<a name="line.147"></a>
+<span class="sourceLineNo">148</span>                iRm1[j] = (j + r - 1) % r;<a name="line.148"></a>
+<span class="sourceLineNo">149</span>                iRm2[j] = (j + r - 2) % r;<a name="line.149"></a>
+<span class="sourceLineNo">150</span>                i1[j] = (j + m1) % r;<a name="line.150"></a>
+<span class="sourceLineNo">151</span>                i2[j] = (j + m2) % r;<a name="line.151"></a>
+<span class="sourceLineNo">152</span>                i3[j] = (j + m3) % r;<a name="line.152"></a>
+<span class="sourceLineNo">153</span>            }<a name="line.153"></a>
+<span class="sourceLineNo">154</span>        }<a name="line.154"></a>
+<span class="sourceLineNo">155</span><a name="line.155"></a>
+<span class="sourceLineNo">156</span>        /**<a name="line.156"></a>
+<span class="sourceLineNo">157</span>         * Returns the predecessor of the given index modulo the table size.<a name="line.157"></a>
+<span class="sourceLineNo">158</span>         * @param index the index to look at<a name="line.158"></a>
+<span class="sourceLineNo">159</span>         * @return (index - 1) % table size<a name="line.159"></a>
+<span class="sourceLineNo">160</span>         */<a name="line.160"></a>
+<span class="sourceLineNo">161</span>        public int getIndexPred(final int index) {<a name="line.161"></a>
+<span class="sourceLineNo">162</span>            return iRm1[index];<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>        /**<a name="line.165"></a>
+<span class="sourceLineNo">166</span>         * Returns the second predecessor of the given index modulo the table size.<a name="line.166"></a>
+<span class="sourceLineNo">167</span>         * @param index the index to look at<a name="line.167"></a>
+<span class="sourceLineNo">168</span>         * @return (index - 2) % table size<a name="line.168"></a>
+<span class="sourceLineNo">169</span>         */<a name="line.169"></a>
+<span class="sourceLineNo">170</span>        public int getIndexPred2(final int index) {<a name="line.170"></a>
+<span class="sourceLineNo">171</span>            return iRm2[index];<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>        /**<a name="line.174"></a>
+<span class="sourceLineNo">175</span>         * Returns index + M1 modulo the table size.<a name="line.175"></a>
+<span class="sourceLineNo">176</span>         * @param index the index to look at<a name="line.176"></a>
+<span class="sourceLineNo">177</span>         * @return (index + M1) % table size<a name="line.177"></a>
+<span class="sourceLineNo">178</span>         */<a name="line.178"></a>
+<span class="sourceLineNo">179</span>        public int getIndexM1(final int index) {<a name="line.179"></a>
+<span class="sourceLineNo">180</span>            return i1[index];<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>        /**<a name="line.183"></a>
+<span class="sourceLineNo">184</span>         * Returns index + M2 modulo the table size.<a name="line.184"></a>
+<span class="sourceLineNo">185</span>         * @param index the index to look at<a name="line.185"></a>
+<span class="sourceLineNo">186</span>         * @return (index + M2) % table size<a name="line.186"></a>
+<span class="sourceLineNo">187</span>         */<a name="line.187"></a>
+<span class="sourceLineNo">188</span>        public int getIndexM2(final int index) {<a name="line.188"></a>
+<span class="sourceLineNo">189</span>            return i2[index];<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>         * Returns index + M3 modulo the table size.<a name="line.193"></a>
+<span class="sourceLineNo">194</span>         * @param index the index to look at<a name="line.194"></a>
+<span class="sourceLineNo">195</span>         * @return (index + M3) % table size<a name="line.195"></a>
+<span class="sourceLineNo">196</span>         */<a name="line.196"></a>
+<span class="sourceLineNo">197</span>        public int getIndexM3(final int index) {<a name="line.197"></a>
+<span class="sourceLineNo">198</span>            return i3[index];<a name="line.198"></a>
+<span class="sourceLineNo">199</span>        }<a name="line.199"></a>
+<span class="sourceLineNo">200</span>    }<a name="line.200"></a>
+<span class="sourceLineNo">201</span>}<a name="line.201"></a>
 
 
 

Added: 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 (added)
+++ websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/KISSRandom.html Fri Sep  2 16:37:56 2016
@@ -0,0 +1,203 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
+<html lang="en">
+<head>
+<title>Source code</title>
+<link rel="stylesheet" type="text/css" href="../../../../../../../stylesheet.css" title="Style">
+</head>
+<body>
+<div class="sourceContainer">
+<pre><span class="sourceLineNo">001</span>/*<a name="line.1"></a>
+<span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a>
+<span class="sourceLineNo">003</span> * contributor license agreements.  See the NOTICE file distributed with<a name="line.3"></a>
+<span class="sourceLineNo">004</span> * this work for additional information regarding copyright ownership.<a name="line.4"></a>
+<span class="sourceLineNo">005</span> * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a>
+<span class="sourceLineNo">006</span> * (the "License"); you may not use this file except in compliance with<a name="line.6"></a>
+<span class="sourceLineNo">007</span> * the License.  You may obtain a copy of the License at<a name="line.7"></a>
+<span class="sourceLineNo">008</span> *<a name="line.8"></a>
+<span class="sourceLineNo">009</span> *      http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a>
+<span class="sourceLineNo">010</span> *<a name="line.10"></a>
+<span class="sourceLineNo">011</span> * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a>
+<span class="sourceLineNo">012</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a>
+<span class="sourceLineNo">013</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a>
+<span class="sourceLineNo">014</span> * See the License for the specific language governing permissions and<a name="line.14"></a>
+<span class="sourceLineNo">015</span> * limitations under the License.<a name="line.15"></a>
+<span class="sourceLineNo">016</span> */<a name="line.16"></a>
+<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">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">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">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>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+</pre>
+</div>
+</body>
+</html>
\ No newline at end of file

Propchange: websites/production/commons/content/proper/commons-rng/apidocs/src-html/org/apache/commons/rng/internal/source32/KISSRandom.html
------------------------------------------------------------------------------
    svn:eol-style = native

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 Fri Sep  2 16:37:56 2016
@@ -143,95 +143,100 @@
 <span class="sourceLineNo">135</span>    }<a name="line.135"></a>
 <span class="sourceLineNo">136</span><a name="line.136"></a>
 <span class="sourceLineNo">137</span>    /**<a name="line.137"></a>
-<span class="sourceLineNo">138</span>     * Reinitializes the generator as if just built with the given seed.<a name="line.138"></a>
+<span class="sourceLineNo">138</span>     * Initializes the generator with the given seed.<a name="line.138"></a>
 <span class="sourceLineNo">139</span>     *<a name="line.139"></a>
 <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>        initState(19650218);<a name="line.143"></a>
-<span class="sourceLineNo">144</span>        int i = 1;<a name="line.144"></a>
-<span class="sourceLineNo">145</span>        int j = 0;<a name="line.145"></a>
-<span class="sourceLineNo">146</span><a name="line.146"></a>
-<span class="sourceLineNo">147</span>        for (int k = Math.max(N, seed.length); k != 0; k--) {<a name="line.147"></a>
-<span class="sourceLineNo">148</span>            final long l0 = (mt[i] &amp; LOWER_MASK_LONG) | ((mt[i] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.148"></a>
-<span class="sourceLineNo">149</span>            final long l1 = (mt[i - 1] &amp; LOWER_MASK_LONG) | ((mt[i - 1] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.149"></a>
-<span class="sourceLineNo">150</span>            final long l = (l0 ^ ((l1 ^ (l1 &gt;&gt; 30)) * 1664525l)) + seed[j] + j; // non linear<a name="line.150"></a>
-<span class="sourceLineNo">151</span>            mt[i] = (int) (l &amp; INT_MASK_LONG);<a name="line.151"></a>
-<span class="sourceLineNo">152</span>            i++; j++;<a name="line.152"></a>
-<span class="sourceLineNo">153</span>            if (i &gt;= N) {<a name="line.153"></a>
-<span class="sourceLineNo">154</span>                mt[0] = mt[N - 1];<a name="line.154"></a>
-<span class="sourceLineNo">155</span>                i = 1;<a name="line.155"></a>
-<span class="sourceLineNo">156</span>            }<a name="line.156"></a>
-<span class="sourceLineNo">157</span>            if (j &gt;= seed.length) {<a name="line.157"></a>
-<span class="sourceLineNo">158</span>                j = 0;<a name="line.158"></a>
-<span class="sourceLineNo">159</span>            }<a name="line.159"></a>
-<span class="sourceLineNo">160</span>        }<a name="line.160"></a>
-<span class="sourceLineNo">161</span><a name="line.161"></a>
-<span class="sourceLineNo">162</span>        for (int k = N - 1; k != 0; k--) {<a name="line.162"></a>
-<span class="sourceLineNo">163</span>            final long l0 = (mt[i] &amp; LOWER_MASK_LONG) | ((mt[i] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.163"></a>
-<span class="sourceLineNo">164</span>            final long l1 = (mt[i - 1] &amp; LOWER_MASK_LONG) | ((mt[i - 1] &lt; 0) ? UPPER_MASK_LONG : 0);<a name="line.164"></a>
-<span class="sourceLineNo">165</span>            final long l  = (l0 ^ ((l1 ^ (l1 &gt;&gt; 30)) * 1566083941l)) - i; // non linear<a name="line.165"></a>
-<span class="sourceLineNo">166</span>            mt[i] = (int) (l &amp; INT_MASK_LONG);<a name="line.166"></a>
-<span class="sourceLineNo">167</span>            i++;<a name="line.167"></a>
-<span class="sourceLineNo">168</span>            if (i &gt;= N) {<a name="line.168"></a>
-<span class="sourceLineNo">169</span>                mt[0] = mt[N - 1];<a name="line.169"></a>
-<span class="sourceLineNo">170</span>                i = 1;<a name="line.170"></a>
-<span class="sourceLineNo">171</span>            }<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>        mt[0] = UPPER_MASK; // MSB is 1; assuring non-zero initial array<a name="line.174"></a>
-<span class="sourceLineNo">175</span>    }<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>     * Initialize the internal state of this instance.<a name="line.178"></a>
-<span class="sourceLineNo">179</span>     *<a name="line.179"></a>
-<span class="sourceLineNo">180</span>     * @param seed Seed.<a name="line.180"></a>
-<span class="sourceLineNo">181</span>     */<a name="line.181"></a>
-<span class="sourceLineNo">182</span>    private void initState(int seed) {<a name="line.182"></a>
-<span class="sourceLineNo">183</span>        long longMT = seed &amp; INT_MASK_LONG;<a name="line.183"></a>
-<span class="sourceLineNo">184</span>        mt[0] = (int) longMT;<a name="line.184"></a>
-<span class="sourceLineNo">185</span>        for (mti = 1; mti &lt; N; ++mti) {<a name="line.185"></a>
-<span class="sourceLineNo">186</span>            longMT = (1812433253L * (longMT ^ (longMT &gt;&gt; 30)) + mti) &amp; INT_MASK_LONG;<a name="line.186"></a>
-<span class="sourceLineNo">187</span>            mt[mti] = (int) longMT;<a name="line.187"></a>
-<span class="sourceLineNo">188</span>        }<a name="line.188"></a>
-<span class="sourceLineNo">189</span>    }<a name="line.189"></a>
-<span class="sourceLineNo">190</span><a name="line.190"></a>
-<span class="sourceLineNo">191</span>    /** {@inheritDoc} */<a name="line.191"></a>
-<span class="sourceLineNo">192</span>    @Override<a name="line.192"></a>
-<span class="sourceLineNo">193</span>    public int next() {<a name="line.193"></a>
-<span class="sourceLineNo">194</span>        int y;<a name="line.194"></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">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>        if (mti &gt;= N) { // Generate N words at one time.<a name="line.196"></a>
-<span class="sourceLineNo">197</span>            int mtNext = mt[0];<a name="line.197"></a>
-<span class="sourceLineNo">198</span>            for (int k = 0; k &lt; N - M; ++k) {<a name="line.198"></a>
-<span class="sourceLineNo">199</span>                int mtCurr = mtNext;<a name="line.199"></a>
-<span class="sourceLineNo">200</span>                mtNext = mt[k + 1];<a name="line.200"></a>
-<span class="sourceLineNo">201</span>                y = (mtCurr &amp; UPPER_MASK) | (mtNext &amp; LOWER_MASK);<a name="line.201"></a>
-<span class="sourceLineNo">202</span>                mt[k] = mt[k + M] ^ (y &gt;&gt;&gt; 1) ^ MAG01[y &amp; 1];<a name="line.202"></a>
-<span class="sourceLineNo">203</span>            }<a name="line.203"></a>
-<span class="sourceLineNo">204</span>            for (int k = N - M; k &lt; N - 1; ++k) {<a name="line.204"></a>
-<span class="sourceLineNo">205</span>                int mtCurr = mtNext;<a name="line.205"></a>
-<span class="sourceLineNo">206</span>                mtNext = mt[k + 1];<a name="line.206"></a>
-<span class="sourceLineNo">207</span>                y = (mtCurr &amp; UPPER_MASK) | (mtNext &amp; LOWER_MASK);<a name="line.207"></a>
-<span class="sourceLineNo">208</span>                mt[k] = mt[k + (M - N)] ^ (y &gt;&gt;&gt; 1) ^ MAG01[y &amp; 1];<a name="line.208"></a>
-<span class="sourceLineNo">209</span>            }<a name="line.209"></a>
-<span class="sourceLineNo">210</span>            y = (mtNext &amp; UPPER_MASK) | (mt[0] &amp; LOWER_MASK);<a name="line.210"></a>
-<span class="sourceLineNo">211</span>            mt[N - 1] = mt[M - 1] ^ (y &gt;&gt;&gt; 1) ^ MAG01[y &amp; 1];<a name="line.211"></a>
-<span class="sourceLineNo">212</span><a name="line.212"></a>
-<span class="sourceLineNo">213</span>            mti = 0;<a name="line.213"></a>
-<span class="sourceLineNo">214</span>        }<a name="line.214"></a>
-<span class="sourceLineNo">215</span><a name="line.215"></a>
-<span class="sourceLineNo">216</span>        y = mt[mti++];<a name="line.216"></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>        // Tempering.<a name="line.218"></a>
-<span class="sourceLineNo">219</span>        y ^=  y &gt;&gt;&gt; 11;<a name="line.219"></a>
-<span class="sourceLineNo">220</span>        y ^= (y &lt;&lt; 7) &amp; 0x9d2c5680;<a name="line.220"></a>
-<span class="sourceLineNo">221</span>        y ^= (y &lt;&lt; 15) &amp; 0xefc60000;<a name="line.221"></a>
-<span class="sourceLineNo">222</span>        y ^=  y &gt;&gt;&gt; 18;<a name="line.222"></a>
-<span class="sourceLineNo">223</span><a name="line.223"></a>
-<span class="sourceLineNo">224</span>        return y;<a name="line.224"></a>
-<span class="sourceLineNo">225</span>    }<a name="line.225"></a>
-<span class="sourceLineNo">226</span>}<a name="line.226"></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>
 
 
 



Mime
View raw message