Lines Matching refs:bits
49 * up to 32 pseudorandomly generated bits.
147 * happens to use only 48 bits of the given seed. In general, however,
148 * an overriding method may use all 64 bits of the {@code long}
163 * {@code int} value and if the argument {@code bits} is between
165 * bits of the returned value will be (approximately) independently
171 * <pre>{@code (int)(seed >>> (48 - bits))}.</pre>
178 * @param bits random bits
183 protected int next(int bits) {
190 return (int)(nextseed >>> (48 - bits));
259 * int bits, val;
261 * bits = next(31);
262 * val = bits % n;
263 * } while (bits - val + (n-1) < 0);
269 * independently chosen bits. If it were a perfect source of randomly
270 * chosen bits, then the algorithm shown would choose {@code int}
280 * returns the correct number of high-order bits from the underlying
282 * the correct number of <i>low-order</i> bits would be returned. Linear
285 * sequence of values of their low-order bits. Thus, this special case
305 int bits, val;
307 bits = next(31);
308 val = bits % n;
309 } while (bits - val + (n-1) < 0);
326 * Because class {@code Random} uses a seed with only 48 bits,
385 * independently chosen bits. If it were a perfect source of randomly
386 * chosen bits, then the algorithm shown would choose {@code float}
424 * source of independently chosen bits. If it were a perfect source of
425 * randomly chosen bits, then the algorithm shown would choose