@sitevision/api 2023.2.1 → 2023.2.2-beta.2

package/types/java/util/Random/index.d.ts

@@ -0,0 +1,605 @@
+import type { IntStream } from "../stream/IntStream";
+import type { LongStream } from "../stream/LongStream";
+import type { DoubleStream } from "../stream/DoubleStream";
+import type { Object } from "../../lang/Object";
+import type { Serializable } from "../../io/Serializable";
+
+/**
+ * An instance of this class is used to generate a stream of
+ *  pseudorandom numbers. The class uses a 48-bit seed, which is
+ *  modified using a linear congruential formula. (See Donald Knuth,
+ *  <i>The Art of Computer Programming, Volume 2</i>, Section 3.2.1.)
+ *  <p>
+ *  If two instances of {@code Random} are created with the same
+ *  seed, and the same sequence of method calls is made for each, they
+ *  will generate and return identical sequences of numbers. In order to
+ *  guarantee this property, particular algorithms are specified for the
+ *  class {@code Random}. Java implementations must use all the algorithms
+ *  shown here for the class {@code Random}, for the sake of absolute
+ *  portability of Java code. However, subclasses of class {@code Random}
+ *  are permitted to use other algorithms, so long as they adhere to the
+ *  general contracts for all the methods.
+ *  <p>
+ *  The algorithms implemented by class {@code Random} use a
+ *  {@code protected} utility method that on each invocation can supply
+ *  up to 32 pseudorandomly generated bits.
+ *  <p>
+ *  Many applications will find the method {@link Math#random} simpler to use.
+ *
+ *  <p>Instances of {@code java.util.Random} are threadsafe.
+ *  However, the concurrent use of the same {@code java.util.Random}
+ *  instance across threads may encounter contention and consequent
+ *  poor performance. Consider instead using
+ *  {@link java.util.concurrent.ThreadLocalRandom} in multithreaded
+ *  designs.
+ *
+ *  <p>Instances of {@code java.util.Random} are not cryptographically
+ *  secure.  Consider instead using {@link java.security.SecureRandom} to
+ *  get a cryptographically secure pseudo-random number generator for use
+ *  by security-sensitive applications.
+ * @author Frank Yellin
+ * @since 1.0
+ */
+export type Random = Object &
+  Serializable & {
+    /**
+     * Sets the seed of this random number generator using a single
+     *  {@code long} seed. The general contract of {@code setSeed} is
+     *  that it alters the state of this random number generator object
+     *  so as to be in exactly the same state as if it had just been
+     *  created with the argument {@code seed} as a seed. The method
+     *  {@code setSeed} is implemented by class {@code Random} by
+     *  atomically updating the seed to
+     *   <pre>{@code (seed ^ 0x5DEECE66DL) & ((1L << 48) - 1)}</pre>
+     *  and clearing the {@code haveNextNextGaussian} flag used by {@link
+     *  #nextGaussian}.
+     *
+     *  <p>The implementation of {@code setSeed} by class {@code Random}
+     *  happens to use only 48 bits of the given seed. In general, however,
+     *  an overriding method may use all 64 bits of the {@code long}
+     *  argument as a seed value.
+     * @param seed the initial seed
+     */
+    setSeed(seed: number): void;
+
+    /**
+     * Generates the next pseudorandom number. Subclasses should
+     *  override this, as this is used by all other methods.
+     *
+     *  <p>The general contract of {@code next} is that it returns an
+     *  {@code int} value and if the argument {@code bits} is between
+     *  {@code 1} and {@code 32} (inclusive), then that many low-order
+     *  bits of the returned value will be (approximately) independently
+     *  chosen bit values, each of which is (approximately) equally
+     *  likely to be {@code 0} or {@code 1}. The method {@code next} is
+     *  implemented by class {@code Random} by atomically updating the seed to
+     *   <pre>{@code (seed * 0x5DEECE66DL + 0xBL) & ((1L << 48) - 1)}</pre>
+     *  and returning
+     *   <pre>{@code (int)(seed >>> (48 - bits))}.</pre>
+     *
+     *  This is a linear congruential pseudorandom number generator, as
+     *  defined by D. H. Lehmer and described by Donald E. Knuth in
+     *  <i>The Art of Computer Programming,</i> Volume 3:
+     *  <i>Seminumerical Algorithms</i>, section 3.2.1.
+     * @param bits random bits
+     * @return the next pseudorandom value from this random number&#xA; generator's sequence
+     * @since 1.1
+     */
+    next(bits: number): number;
+
+    /**
+     * Generates random bytes and places them into a user-supplied
+     *  byte array.  The number of random bytes produced is equal to
+     *  the length of the byte array.
+     *
+     *  <p>The method {@code nextBytes} is implemented by class {@code Random}
+     *  as if by:
+     *   <pre> {@code
+     *  public void nextBytes(byte[] bytes) {
+     *    for (int i = 0; i < bytes.length; )
+     *      for (int rnd = nextInt(), n = Math.min(bytes.length - i, 4);
+     *           n-- > 0; rnd >>= 8)
+     *        bytes[i++] = (byte)rnd;
+     *  }}</pre>
+     * @param bytes the byte array to fill with random bytes
+     * @throws NullPointerException if the byte array is null
+     * @since 1.1
+     */
+    nextBytes(bytes: unknown[]): void;
+
+    /**
+     * Returns the next pseudorandom, uniformly distributed {@code int}
+     *  value from this random number generator's sequence. The general
+     *  contract of {@code nextInt} is that one {@code int} value is
+     *  pseudorandomly generated and returned. All 2<sup>32</sup> possible
+     *  {@code int} values are produced with (approximately) equal probability.
+     *
+     *  <p>The method {@code nextInt} is implemented by class {@code Random}
+     *  as if by:
+     *   <pre> {@code
+     *  public int nextInt() {
+     *    return next(32);
+     *  }}</pre>
+     * @return the next pseudorandom, uniformly distributed {@code int}&#xA; value from this random number generator's sequence
+     */
+    nextInt(): number;
+
+    /**
+     * Returns a pseudorandom, uniformly distributed {@code int} value
+     *  between 0 (inclusive) and the specified value (exclusive), drawn from
+     *  this random number generator's sequence.  The general contract of
+     *  {@code nextInt} is that one {@code int} value in the specified range
+     *  is pseudorandomly generated and returned.  All {@code bound} possible
+     *  {@code int} values are produced with (approximately) equal
+     *  probability.  The method {@code nextInt(int bound)} is implemented by
+     *  class {@code Random} as if by:
+     *   <pre> {@code
+     *  public int nextInt(int bound) {
+     *    if (bound <= 0)
+     *      throw new IllegalArgumentException("bound must be positive");
+     *
+     *    if ((bound & -bound) == bound)  // i.e., bound is a power of 2
+     *      return (int)((bound * (long)next(31)) >> 31);
+     *
+     *    int bits, val;
+     *    do {
+     *        bits = next(31);
+     *        val = bits % bound;
+     *    } while (bits - val + (bound-1) < 0);
+     *    return val;
+     *  }}</pre>
+     *
+     *  <p>The hedge "approximately" is used in the foregoing description only
+     *  because the next method is only approximately an unbiased source of
+     *  independently chosen bits.  If it were a perfect source of randomly
+     *  chosen bits, then the algorithm shown would choose {@code int}
+     *  values from the stated range with perfect uniformity.
+     *  <p>
+     *  The algorithm is slightly tricky.  It rejects values that would result
+     *  in an uneven distribution (due to the fact that 2^31 is not divisible
+     *  by n). The probability of a value being rejected depends on n.  The
+     *  worst case is n=2^30+1, for which the probability of a reject is 1/2,
+     *  and the expected number of iterations before the loop terminates is 2.
+     *  <p>
+     *  The algorithm treats the case where n is a power of two specially: it
+     *  returns the correct number of high-order bits from the underlying
+     *  pseudo-random number generator.  In the absence of special treatment,
+     *  the correct number of <i>low-order</i> bits would be returned.  Linear
+     *  congruential pseudo-random number generators such as the one
+     *  implemented by this class are known to have short periods in the
+     *  sequence of values of their low-order bits.  Thus, this special case
+     *  greatly increases the length of the sequence of values returned by
+     *  successive calls to this method if n is a small power of two.
+     * @param bound the upper bound (exclusive). Must be positive.
+     * @return the next pseudorandom, uniformly distributed {@code int}&#xA; value between zero (inclusive) and {@code bound} (exclusive)&#xA; from this random number generator's sequence
+     * @throws IllegalArgumentException if bound is not positive
+     * @since 1.2
+     */
+    nextInt(bound: number): number;
+
+    /**
+     * Returns the next pseudorandom, uniformly distributed {@code long}
+     *  value from this random number generator's sequence. The general
+     *  contract of {@code nextLong} is that one {@code long} value is
+     *  pseudorandomly generated and returned.
+     *
+     *  <p>The method {@code nextLong} is implemented by class {@code Random}
+     *  as if by:
+     *   <pre> {@code
+     *  public long nextLong() {
+     *    return ((long)next(32) << 32) + next(32);
+     *  }}</pre>
+     *
+     *  Because class {@code Random} uses a seed with only 48 bits,
+     *  this algorithm will not return all possible {@code long} values.
+     * @return the next pseudorandom, uniformly distributed {@code long}&#xA; value from this random number generator's sequence
+     */
+    nextLong(): number;
+
+    /**
+     * Returns the next pseudorandom, uniformly distributed
+     *  {@code boolean} value from this random number generator's
+     *  sequence. The general contract of {@code nextBoolean} is that one
+     *  {@code boolean} value is pseudorandomly generated and returned.  The
+     *  values {@code true} and {@code false} are produced with
+     *  (approximately) equal probability.
+     *
+     *  <p>The method {@code nextBoolean} is implemented by class {@code Random}
+     *  as if by:
+     *   <pre> {@code
+     *  public boolean nextBoolean() {
+     *    return next(1) != 0;
+     *  }}</pre>
+     * @return the next pseudorandom, uniformly distributed&#xA; {@code boolean} value from this random number generator's&#xA; sequence
+     * @since 1.2
+     */
+    nextBoolean(): boolean;
+
+    /**
+     * Returns the next pseudorandom, uniformly distributed {@code float}
+     *  value between {@code 0.0} and {@code 1.0} from this random
+     *  number generator's sequence.
+     *
+     *  <p>The general contract of {@code nextFloat} is that one
+     *  {@code float} value, chosen (approximately) uniformly from the
+     *  range {@code 0.0f} (inclusive) to {@code 1.0f} (exclusive), is
+     *  pseudorandomly generated and returned. All 2<sup>24</sup> possible
+     *  {@code float} values of the form <i>m&nbsp;x&nbsp;</i>2<sup>-24</sup>,
+     *  where <i>m</i> is a positive integer less than 2<sup>24</sup>, are
+     *  produced with (approximately) equal probability.
+     *
+     *  <p>The method {@code nextFloat} is implemented by class {@code Random}
+     *  as if by:
+     *   <pre> {@code
+     *  public float nextFloat() {
+     *    return next(24) / ((float)(1 << 24));
+     *  }}</pre>
+     *
+     *  <p>The hedge "approximately" is used in the foregoing description only
+     *  because the next method is only approximately an unbiased source of
+     *  independently chosen bits. If it were a perfect source of randomly
+     *  chosen bits, then the algorithm shown would choose {@code float}
+     *  values from the stated range with perfect uniformity.<p>
+     *  [In early versions of Java, the result was incorrectly calculated as:
+     *   <pre> {@code
+     *    return next(30) / ((float)(1 << 30));}</pre>
+     *  This might seem to be equivalent, if not better, but in fact it
+     *  introduced a slight nonuniformity because of the bias in the rounding
+     *  of floating-point numbers: it was slightly more likely that the
+     *  low-order bit of the significand would be 0 than that it would be 1.]
+     * @return the next pseudorandom, uniformly distributed {@code float}&#xA; value between {@code 0.0} and {@code 1.0} from this&#xA; random number generator's sequence
+     */
+    nextFloat(): number;
+
+    /**
+     * Returns the next pseudorandom, uniformly distributed
+     *  {@code double} value between {@code 0.0} and
+     *  {@code 1.0} from this random number generator's sequence.
+     *
+     *  <p>The general contract of {@code nextDouble} is that one
+     *  {@code double} value, chosen (approximately) uniformly from the
+     *  range {@code 0.0d} (inclusive) to {@code 1.0d} (exclusive), is
+     *  pseudorandomly generated and returned.
+     *
+     *  <p>The method {@code nextDouble} is implemented by class {@code Random}
+     *  as if by:
+     *   <pre> {@code
+     *  public double nextDouble() {
+     *    return (((long)next(26) << 27) + next(27))
+     *      / (double)(1L << 53);
+     *  }}</pre>
+     *
+     *  <p>The hedge "approximately" is used in the foregoing description only
+     *  because the {@code next} method is only approximately an unbiased
+     *  source of independently chosen bits. If it were a perfect source of
+     *  randomly chosen bits, then the algorithm shown would choose
+     *  {@code double} values from the stated range with perfect uniformity.
+     *  <p>[In early versions of Java, the result was incorrectly calculated as:
+     *   <pre> {@code
+     *    return (((long)next(27) << 27) + next(27))
+     *      / (double)(1L << 54);}</pre>
+     *  This might seem to be equivalent, if not better, but in fact it
+     *  introduced a large nonuniformity because of the bias in the rounding
+     *  of floating-point numbers: it was three times as likely that the
+     *  low-order bit of the significand would be 0 than that it would be 1!
+     *  This nonuniformity probably doesn't matter much in practice, but we
+     *  strive for perfection.]
+     * @return the next pseudorandom, uniformly distributed {@code double}&#xA; value between {@code 0.0} and {@code 1.0} from this&#xA; random number generator's sequence
+     * @see Math#random
+     */
+    nextDouble(): number;
+
+    /**
+     * Returns the next pseudorandom, Gaussian ("normally") distributed
+     *  {@code double} value with mean {@code 0.0} and standard
+     *  deviation {@code 1.0} from this random number generator's sequence.
+     *  <p>
+     *  The general contract of {@code nextGaussian} is that one
+     *  {@code double} value, chosen from (approximately) the usual
+     *  normal distribution with mean {@code 0.0} and standard deviation
+     *  {@code 1.0}, is pseudorandomly generated and returned.
+     *
+     *  <p>The method {@code nextGaussian} is implemented by class
+     *  {@code Random} as if by a threadsafe version of the following:
+     *   <pre> {@code
+     *  private double nextNextGaussian;
+     *  private boolean haveNextNextGaussian = false;
+     *
+     *  public double nextGaussian() {
+     *    if (haveNextNextGaussian) {
+     *      haveNextNextGaussian = false;
+     *      return nextNextGaussian;
+     *    } else {
+     *      double v1, v2, s;
+     *      do {
+     *        v1 = 2 * nextDouble() - 1;   // between -1.0 and 1.0
+     *        v2 = 2 * nextDouble() - 1;   // between -1.0 and 1.0
+     *        s = v1 * v1 + v2 * v2;
+     *      } while (s >= 1 || s == 0);
+     *      double multiplier = StrictMath.sqrt(-2 * StrictMath.log(s)/s);
+     *      nextNextGaussian = v2 * multiplier;
+     *      haveNextNextGaussian = true;
+     *      return v1 * multiplier;
+     *    }
+     *  }}</pre>
+     *  This uses the <i>polar method</i> of G. E. P. Box, M. E. Muller, and
+     *  G. Marsaglia, as described by Donald E. Knuth in <i>The Art of
+     *  Computer Programming</i>, Volume 3: <i>Seminumerical Algorithms</i>,
+     *  section 3.4.1, subsection C, algorithm P. Note that it generates two
+     *  independent values at the cost of only one call to {@code StrictMath.log}
+     *  and one call to {@code StrictMath.sqrt}.
+     * @return the next pseudorandom, Gaussian ("normally") distributed&#xA; {@code double} value with mean {@code 0.0} and&#xA; standard deviation {@code 1.0} from this random number&#xA; generator's sequence
+     */
+    nextGaussian(): number;
+
+    /**
+     * Returns a stream producing the given {@code streamSize} number of
+     *  pseudorandom {@code int} values.
+     *
+     *  <p>A pseudorandom {@code int} value is generated as if it's the result of
+     *  calling the method {@link #nextInt()}.
+     * @param streamSize the number of values to generate
+     * @return a stream of pseudorandom {@code int} values
+     * @throws IllegalArgumentException if {@code streamSize} is&#xA; less than zero
+     * @since 1.8
+     */
+    ints(streamSize: number): IntStream;
+
+    /**
+     * Returns an effectively unlimited stream of pseudorandom {@code int}
+     *  values.
+     *
+     *  <p>A pseudorandom {@code int} value is generated as if it's the result of
+     *  calling the method {@link #nextInt()}.
+     * @implNote This method is implemented to be equivalent to {@code&#xA; ints(Long.MAX_VALUE)}.
+     * @return a stream of pseudorandom {@code int} values
+     * @since 1.8
+     */
+    ints(): IntStream;
+
+    /**
+     * Returns a stream producing the given {@code streamSize} number
+     *  of pseudorandom {@code int} values, each conforming to the given
+     *  origin (inclusive) and bound (exclusive).
+     *
+     *  <p>A pseudorandom {@code int} value is generated as if it's the result of
+     *  calling the following method with the origin and bound:
+     *  <pre> {@code
+     *  int nextInt(int origin, int bound) {
+     *    int n = bound - origin;
+     *    if (n > 0) {
+     *      return nextInt(n) + origin;
+     *    }
+     *    else {  // range not representable as int
+     *      int r;
+     *      do {
+     *        r = nextInt();
+     *      } while (r < origin || r >= bound);
+     *      return r;
+     *    }
+     *  }}</pre>
+     * @param streamSize the number of values to generate
+     * @param randomNumberOrigin the origin (inclusive) of each random value
+     * @param randomNumberBound the bound (exclusive) of each random value
+     * @return a stream of pseudorandom {@code int} values,&#xA; each with the given origin (inclusive) and bound (exclusive)
+     * @throws IllegalArgumentException if {@code streamSize} is&#xA; less than zero, or {@code randomNumberOrigin}&#xA; is greater than or equal to {@code randomNumberBound}
+     * @since 1.8
+     */
+    ints(
+      streamSize: number,
+      randomNumberOrigin: number,
+      randomNumberBound: number
+    ): IntStream;
+
+    /**
+     * Returns an effectively unlimited stream of pseudorandom {@code
+     *  int} values, each conforming to the given origin (inclusive) and bound
+     *  (exclusive).
+     *
+     *  <p>A pseudorandom {@code int} value is generated as if it's the result of
+     *  calling the following method with the origin and bound:
+     *  <pre> {@code
+     *  int nextInt(int origin, int bound) {
+     *    int n = bound - origin;
+     *    if (n > 0) {
+     *      return nextInt(n) + origin;
+     *    }
+     *    else {  // range not representable as int
+     *      int r;
+     *      do {
+     *        r = nextInt();
+     *      } while (r < origin || r >= bound);
+     *      return r;
+     *    }
+     *  }}</pre>
+     * @implNote This method is implemented to be equivalent to {@code&#xA; ints(Long.MAX_VALUE, randomNumberOrigin, randomNumberBound)}.
+     * @param randomNumberOrigin the origin (inclusive) of each random value
+     * @param randomNumberBound the bound (exclusive) of each random value
+     * @return a stream of pseudorandom {@code int} values,&#xA; each with the given origin (inclusive) and bound (exclusive)
+     * @throws IllegalArgumentException if {@code randomNumberOrigin}&#xA; is greater than or equal to {@code randomNumberBound}
+     * @since 1.8
+     */
+    ints(randomNumberOrigin: number, randomNumberBound: number): IntStream;
+
+    /**
+     * Returns a stream producing the given {@code streamSize} number of
+     *  pseudorandom {@code long} values.
+     *
+     *  <p>A pseudorandom {@code long} value is generated as if it's the result
+     *  of calling the method {@link #nextLong()}.
+     * @param streamSize the number of values to generate
+     * @return a stream of pseudorandom {@code long} values
+     * @throws IllegalArgumentException if {@code streamSize} is&#xA; less than zero
+     * @since 1.8
+     */
+    longs(streamSize: number): LongStream;
+
+    /**
+     * Returns an effectively unlimited stream of pseudorandom {@code long}
+     *  values.
+     *
+     *  <p>A pseudorandom {@code long} value is generated as if it's the result
+     *  of calling the method {@link #nextLong()}.
+     * @implNote This method is implemented to be equivalent to {@code&#xA; longs(Long.MAX_VALUE)}.
+     * @return a stream of pseudorandom {@code long} values
+     * @since 1.8
+     */
+    longs(): LongStream;
+
+    /**
+     * Returns a stream producing the given {@code streamSize} number of
+     *  pseudorandom {@code long}, each conforming to the given origin
+     *  (inclusive) and bound (exclusive).
+     *
+     *  <p>A pseudorandom {@code long} value is generated as if it's the result
+     *  of calling the following method with the origin and bound:
+     *  <pre> {@code
+     *  long nextLong(long origin, long bound) {
+     *    long r = nextLong();
+     *    long n = bound - origin, m = n - 1;
+     *    if ((n & m) == 0L)  // power of two
+     *      r = (r & m) + origin;
+     *    else if (n > 0L) {  // reject over-represented candidates
+     *      for (long u = r >>> 1;            // ensure nonnegative
+     *           u + m - (r = u % n) < 0L;    // rejection check
+     *           u = nextLong() >>> 1) // retry
+     *          ;
+     *      r += origin;
+     *    }
+     *    else {              // range not representable as long
+     *      while (r < origin || r >= bound)
+     *        r = nextLong();
+     *    }
+     *    return r;
+     *  }}</pre>
+     * @param streamSize the number of values to generate
+     * @param randomNumberOrigin the origin (inclusive) of each random value
+     * @param randomNumberBound the bound (exclusive) of each random value
+     * @return a stream of pseudorandom {@code long} values,&#xA; each with the given origin (inclusive) and bound (exclusive)
+     * @throws IllegalArgumentException if {@code streamSize} is&#xA; less than zero, or {@code randomNumberOrigin}&#xA; is greater than or equal to {@code randomNumberBound}
+     * @since 1.8
+     */
+    longs(
+      streamSize: number,
+      randomNumberOrigin: number,
+      randomNumberBound: number
+    ): LongStream;
+
+    /**
+     * Returns an effectively unlimited stream of pseudorandom {@code
+     *  long} values, each conforming to the given origin (inclusive) and bound
+     *  (exclusive).
+     *
+     *  <p>A pseudorandom {@code long} value is generated as if it's the result
+     *  of calling the following method with the origin and bound:
+     *  <pre> {@code
+     *  long nextLong(long origin, long bound) {
+     *    long r = nextLong();
+     *    long n = bound - origin, m = n - 1;
+     *    if ((n & m) == 0L)  // power of two
+     *      r = (r & m) + origin;
+     *    else if (n > 0L) {  // reject over-represented candidates
+     *      for (long u = r >>> 1;            // ensure nonnegative
+     *           u + m - (r = u % n) < 0L;    // rejection check
+     *           u = nextLong() >>> 1) // retry
+     *          ;
+     *      r += origin;
+     *    }
+     *    else {              // range not representable as long
+     *      while (r < origin || r >= bound)
+     *        r = nextLong();
+     *    }
+     *    return r;
+     *  }}</pre>
+     * @implNote This method is implemented to be equivalent to {@code&#xA; longs(Long.MAX_VALUE, randomNumberOrigin, randomNumberBound)}.
+     * @param randomNumberOrigin the origin (inclusive) of each random value
+     * @param randomNumberBound the bound (exclusive) of each random value
+     * @return a stream of pseudorandom {@code long} values,&#xA; each with the given origin (inclusive) and bound (exclusive)
+     * @throws IllegalArgumentException if {@code randomNumberOrigin}&#xA; is greater than or equal to {@code randomNumberBound}
+     * @since 1.8
+     */
+    longs(randomNumberOrigin: number, randomNumberBound: number): LongStream;
+
+    /**
+     * Returns a stream producing the given {@code streamSize} number of
+     *  pseudorandom {@code double} values, each between zero
+     *  (inclusive) and one (exclusive).
+     *
+     *  <p>A pseudorandom {@code double} value is generated as if it's the result
+     *  of calling the method {@link #nextDouble()}.
+     * @param streamSize the number of values to generate
+     * @return a stream of {@code double} values
+     * @throws IllegalArgumentException if {@code streamSize} is&#xA; less than zero
+     * @since 1.8
+     */
+    doubles(streamSize: number): DoubleStream;
+
+    /**
+     * Returns an effectively unlimited stream of pseudorandom {@code
+     *  double} values, each between zero (inclusive) and one
+     *  (exclusive).
+     *
+     *  <p>A pseudorandom {@code double} value is generated as if it's the result
+     *  of calling the method {@link #nextDouble()}.
+     * @implNote This method is implemented to be equivalent to {@code&#xA; doubles(Long.MAX_VALUE)}.
+     * @return a stream of pseudorandom {@code double} values
+     * @since 1.8
+     */
+    doubles(): DoubleStream;
+
+    /**
+     * Returns a stream producing the given {@code streamSize} number of
+     *  pseudorandom {@code double} values, each conforming to the given origin
+     *  (inclusive) and bound (exclusive).
+     *
+     *  <p>A pseudorandom {@code double} value is generated as if it's the result
+     *  of calling the following method with the origin and bound:
+     *  <pre> {@code
+     *  double nextDouble(double origin, double bound) {
+     *    double r = nextDouble();
+     *    r = r * (bound - origin) + origin;
+     *    if (r >= bound) // correct for rounding
+     *      r = Math.nextDown(bound);
+     *    return r;
+     *  }}</pre>
+     * @param streamSize the number of values to generate
+     * @param randomNumberOrigin the origin (inclusive) of each random value
+     * @param randomNumberBound the bound (exclusive) of each random value
+     * @return a stream of pseudorandom {@code double} values,&#xA; each with the given origin (inclusive) and bound (exclusive)
+     * @throws IllegalArgumentException if {@code streamSize} is&#xA; less than zero
+     * @throws IllegalArgumentException if {@code randomNumberOrigin}&#xA; is greater than or equal to {@code randomNumberBound}
+     * @since 1.8
+     */
+    doubles(
+      streamSize: number,
+      randomNumberOrigin: number,
+      randomNumberBound: number
+    ): DoubleStream;
+
+    /**
+     * Returns an effectively unlimited stream of pseudorandom {@code
+     *  double} values, each conforming to the given origin (inclusive) and bound
+     *  (exclusive).
+     *
+     *  <p>A pseudorandom {@code double} value is generated as if it's the result
+     *  of calling the following method with the origin and bound:
+     *  <pre> {@code
+     *  double nextDouble(double origin, double bound) {
+     *    double r = nextDouble();
+     *    r = r * (bound - origin) + origin;
+     *    if (r >= bound) // correct for rounding
+     *      r = Math.nextDown(bound);
+     *    return r;
+     *  }}</pre>
+     * @implNote This method is implemented to be equivalent to {@code&#xA; doubles(Long.MAX_VALUE, randomNumberOrigin, randomNumberBound)}.
+     * @param randomNumberOrigin the origin (inclusive) of each random value
+     * @param randomNumberBound the bound (exclusive) of each random value
+     * @return a stream of pseudorandom {@code double} values,&#xA; each with the given origin (inclusive) and bound (exclusive)
+     * @throws IllegalArgumentException if {@code randomNumberOrigin}&#xA; is greater than or equal to {@code randomNumberBound}
+     * @since 1.8
+     */
+    doubles(
+      randomNumberOrigin: number,
+      randomNumberBound: number
+    ): DoubleStream;
+  };

package/types/java/util/Random/index.js

@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports["default"] = void 0;
+var _default = {
+  setSeed: function setSeed() {},
+  next: function next() {},
+  nextBytes: function nextBytes() {},
+  nextInt: function nextInt() {},
+  nextLong: function nextLong() {},
+  nextBoolean: function nextBoolean() {},
+  nextFloat: function nextFloat() {},
+  nextDouble: function nextDouble() {},
+  nextGaussian: function nextGaussian() {},
+  ints: function ints() {},
+  longs: function longs() {},
+  doubles: function doubles() {}
+};
+exports["default"] = _default;

package/types/java/util/RandomAccess/index.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Marker interface used by <tt>List</tt> implementations to indicate that
+ *  they support fast (generally constant time) random access.  The primary
+ *  purpose of this interface is to allow generic algorithms to alter their
+ *  behavior to provide good performance when applied to either random or
+ *  sequential access lists.
+ *
+ *  <p>The best algorithms for manipulating random access lists (such as
+ *  <tt>ArrayList</tt>) can produce quadratic behavior when applied to
+ *  sequential access lists (such as <tt>LinkedList</tt>).  Generic list
+ *  algorithms are encouraged to check whether the given list is an
+ *  <tt>instanceof</tt> this interface before applying an algorithm that would
+ *  provide poor performance if it were applied to a sequential access list,
+ *  and to alter their behavior if necessary to guarantee acceptable
+ *  performance.
+ *
+ *  <p>It is recognized that the distinction between random and sequential
+ *  access is often fuzzy.  For example, some <tt>List</tt> implementations
+ *  provide asymptotically linear access times if they get huge, but constant
+ *  access times in practice.  Such a <tt>List</tt> implementation
+ *  should generally implement this interface.  As a rule of thumb, a
+ *  <tt>List</tt> implementation should implement this interface if,
+ *  for typical instances of the class, this loop:
+ *  <pre>
+ *      for (int i=0, n=list.size(); i &lt; n; i++)
+ *          list.get(i);
+ *  </pre>
+ *  runs faster than this loop:
+ *  <pre>
+ *      for (Iterator i=list.iterator(); i.hasNext(); )
+ *          i.next();
+ *  </pre>
+ *
+ *  <p>This interface is a member of the
+ *  <a href="{@docRoot}/../technotes/guides/collections/index.html">
+ *  Java Collections Framework</a>.
+ * @since 1.4
+ */
+export type RandomAccess = {};

package/types/java/util/RandomAccess/index.js

@@ -0,0 +1,8 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports["default"] = void 0;
+var _default = {};
+exports["default"] = _default;