Lines Matching refs:seed
65 * seed.</p>
75 /** Creates a new random number generator using a single int seed.
80 * @param seed the initial seed (32 bits integer)
82 protected AbstractWell(final int k, final int m1, final int m2, final int m3, final int seed) {
83 this(k, m1, m2, m3, new int[] { seed });
86 /** Creates a new random number generator using an int array seed.
91 * @param seed the initial seed (32 bits integers array), if null
92 * the seed of the generator will be related to the current time
94 protected AbstractWell(final int k, final int m1, final int m2, final int m3, final int[] seed) {
120 setSeed(seed);
124 /** Creates a new random number generator using a single long seed.
129 * @param seed the initial seed (64 bits integer)
131 protected AbstractWell(final int k, final int m1, final int m2, final int m3, final long seed) {
132 this(k, m1, m2, m3, new int[] { (int) (seed >>> 32), (int) (seed & 0xffffffffl) });
135 /** Reinitialize the generator as if just built with the given int seed.
137 * generator built with the same seed.</p>
138 * @param seed the initial seed (32 bits integer)
141 public void setSeed(final int seed) {
142 setSeed(new int[] { seed });
145 /** Reinitialize the generator as if just built with the given int array seed.
147 * generator built with the same seed.</p>
148 * @param seed the initial seed (32 bits integers array), if null
149 * the seed of the generator will be related to the current time
152 public void setSeed(final int[] seed) {
154 if (seed == null) {
159 System.arraycopy(seed, 0, v, 0, Math.min(seed.length, v.length));
161 if (seed.length < v.length) {
162 for (int i = seed.length; i < v.length; ++i) {
163 final long l = v[i - seed.length];
172 /** Reinitialize the generator as if just built with the given long seed.
174 * generator built with the same seed.</p>
175 * @param seed the initial seed (64 bits integer)
178 public void setSeed(final long seed) {
179 setSeed(new int[] { (int) (seed >>> 32), (int) (seed & 0xffffffffl) });
