Lines Matching defs:bits
57 * up to 32 pseudorandomly generated bits.
162 * happens to use only 48 bits of the given seed. In general, however,
163 * an overriding method may use all 64 bits of the {@code long}
178 * {@code int} value and if the argument {@code bits} is between
180 * bits of the returned value will be (approximately) independently
186 * <pre>{@code (int)(seed >>> (48 - bits))}.</pre>
193 * @param bits random bits
198 protected int next(int bits) {
205 return (int)(nextseed >>> (48 - bits));
349 * int bits, val;
351 * bits = next(31);
352 * val = bits % bound;
353 * } while (bits - val + (bound-1) < 0);
359 * independently chosen bits. If it were a perfect source of randomly
360 * chosen bits, then the algorithm shown would choose {@code int}
370 * returns the correct number of high-order bits from the underlying
372 * the correct number of <i>low-order</i> bits would be returned. Linear
375 * sequence of values of their low-order bits. Thus, this special case
416 * Because class {@code Random} uses a seed with only 48 bits,
473 * independently chosen bits. If it were a perfect source of randomly
474 * chosen bits, then the algorithm shown would choose {@code float}
512 * source of independently chosen bits. If it were a perfect source of
513 * randomly chosen bits, then the algorithm shown would choose