/libcore/benchmarks/src/benchmarks/regression/ |
H A D | BigIntegerBenchmark.java | 20 import java.util.Random; 24 Random r = new Random(); 33 Random r = new Random(); 42 Random r = new Random();
|
H A D | RandomBenchmark.java | 20 import java.util.Random; 25 Random rng = new Random(); 31 Random rng = new Random();
|
H A D | CollectionsBenchmark.java | 24 import java.util.Random; 71 Random random = new Random();
|
H A D | PriorityQueueBenchmark.java | 25 import java.util.Random; 34 private Random random = new Random(189279387L);
|
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | RandomTest.java | 20 import java.util.Random; 25 // Ensure that Random's constructors call setSeed by emulating the active ingredient 28 class MyRandom extends Random { 48 Random rand = new Random(0); 54 int[] streamRands = new Random(0).ints().limit(limit).toArray(); 61 Random rand = new Random(0); 67 int[] streamRands = new Random(0).ints(size).toArray(); 69 assertEquals(size, new Random( [all...] |
H A D | ArraysTest.java | 20 import java.util.Random; 245 Random rand = new Random(0); 279 Random rand = new Random(0); 320 Random rand = new Random(0); 354 Random rand = new Random(0); 395 Random ran [all...] |
H A D | OldAndroidTreeMapTest.java | 22 import java.util.Random; 30 private Random mRandom = new Random(1);
|
/libcore/ojluni/src/test/java/time/jdk/testlibrary/ |
H A D | RandomFactory.java | 26 import java.util.Random; 31 * for use in initializing a PRNG. An instance of {@code Random} or 60 return new Random().nextLong(); 82 * {@code Random} instance which is returned. If the system 86 * @return The {@code Random} instance. 88 public static Random getRandom() { 89 return new Random(getSeed());
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | RandomTest.java | 22 import java.util.Random; 27 private Random r; 30 * java.util.Random#Random() 33 // Test for method java.util.Random() 38 * java.util.Random#Random(long) 41 Random r = new Random(8409238L); 42 Random r [all...] |
/libcore/benchmarks/src/benchmarks/ |
H A D | SmallBigIntegerBenchmark.java | 20 import java.util.Random; 38 final Random r = new Random();
|
H A D | BufferedZipFileBenchmark.java | 25 import java.util.Random; 42 Random random = new Random(0);
|
H A D | ZipFileBenchmark.java | 25 import java.util.Random; 61 Random random = new Random();
|
H A D | ZipFileReadBenchmark.java | 26 import java.util.Random; 54 Random random = new Random();
|
H A D | XmlSerializeBenchmark.java | 23 import java.util.Random; 54 Random r = new Random(seed);
|
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
H A D | DoublePrimitiveOpsTests.java | 29 import java.util.Random; 58 Random r = new Random(); 76 Random r = new Random();
|
H A D | IntPrimitiveOpsTests.java | 30 import java.util.Random; 101 Random r = new Random(); 119 Random r = new Random();
|
H A D | LongPrimitiveOpsTests.java | 30 import java.util.Random; 101 Random r = new Random(); 119 Random r = new Random();
|
/libcore/luni/src/test/java/libcore/java/math/ |
H A D | BigIntegerTest.java | 20 import java.util.Random; 89 Random rand = new Random(); 104 Random rand = new Random(); 143 Random rand = new Random();
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
H A D | OldBigIntegerTest.java | 21 import java.util.Random; 31 Random rand = new Random(); 40 * java.math.BigInteger#BigInteger(int, java.util.Random) 45 new BigInteger(128, (Random) null); 52 assertTrue("Random number is negative", bi.compareTo(BigInteger.ZERO) >= 0); 53 assertTrue("Random number is too big", bi.compareTo(two.pow(70)) < 0); 60 new BigInteger(-1, (Random)null); 68 * java.math.BigInteger#BigInteger(int, int, java.util.Random) 79 Random ran [all...] |
/libcore/ojluni/src/main/java/java/util/ |
H A D | Random.java | 45 * If two instances of {@code Random} are created with the same 49 * class {@code Random}. Java implementations must use all the algorithms 50 * shown here for the class {@code Random}, for the sake of absolute 51 * portability of Java code. However, subclasses of class {@code Random} 55 * The algorithms implemented by class {@code Random} use a 61 * <p>Instances of {@code java.util.Random} are threadsafe. 62 * However, the concurrent use of the same {@code java.util.Random} 68 * <p>Instances of {@code java.util.Random} are not cryptographically 77 class Random implements java.io.Serializable { class in inherits:java.io.Serializable 104 public Random() { method in class:Random 135 public Random(long seed) { method in class:Random [all...] |
/libcore/luni/src/test/java/libcore/java/util/zip/ |
H A D | GZIPOutputStreamTest.java | 24 import java.util.Random; 43 new Random().nextBytes(data);
|
H A D | OldAndroidZipStressTest.java | 25 import java.util.Random; 129 Random random = new Random(42); // Seed makes test reproducible 138 // Random contents with longer repetitions
|
H A D | GZIPInputStreamTest.java | 29 import java.util.Random; 91 new Random().nextBytes(data); 173 final Random r = new Random(10);
|
H A D | ZipInputStreamTest.java | 27 import java.util.Random; 48 new Random().nextBytes(data);
|
/libcore/support/src/test/java/org/apache/harmony/testframework/ |
H A D | CharSinkTester.java | 27 import java.util.Random; 166 Random dice = new Random();
|