/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
D | SortedMapTestBase.java | 46 Random rnd; field in SortedMapTestBase 49 rnd = new Random(-1); in setUp() 51 ref.put(rnd.nextInt(N) * 2, rnd.nextBoolean() ? null : rnd.nextInt(N) * 2); in setUp() 62 int key = rnd.nextInt(N); in testContainsKey() 70 int value = rnd.nextInt(N); in testContainsValue() 91 int key = rnd.nextInt(N); in testGet() 103 if (rnd.nextBoolean()) { in testKeySet() 113 int key = rnd.nextInt(N); in testPut() 114 int value = rnd.nextInt(N); in testPut() 125 int key = rnd.nextInt(N); in testPut0() [all …]
|
D | HashMapTest.java | 514 Random rnd = new Random(666); in test_putAllLjava_util_Map_Resize() local 519 Integer j = rnd.nextInt(); in test_putAllLjava_util_Map_Resize() 526 Integer j = rnd.nextInt(); in test_putAllLjava_util_Map_Resize() 532 rnd = new Random(666); in test_putAllLjava_util_Map_Resize() 534 Integer j = rnd.nextInt(); in test_putAllLjava_util_Map_Resize()
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
D | ThreadLocalRandomTest.java | 129 ThreadLocalRandom rnd = ThreadLocalRandom.current(); 132 rnd.nextInt(bound); 147 ThreadLocalRandom rnd = ThreadLocalRandom.current(); 150 rnd.nextInt(badBounds[0], badBounds[1]); 201 ThreadLocalRandom rnd = ThreadLocalRandom.current(); 204 rnd.nextLong(bound); 219 ThreadLocalRandom rnd = ThreadLocalRandom.current(); 222 rnd.nextLong(badBounds[0], badBounds[1]); 272 ThreadLocalRandom rnd = ThreadLocalRandom.current(); 282 rnd.nextDouble(bound);
|
D | TreeSetTest.java | 666 Random rnd = new Random(666); field in TreeSetTest 711 int element = rnd.nextInt(limit); in populate() 722 remove(set, min - 5 + rnd.nextInt(rangeSize + 10)); in mutateSet() 727 if (rnd.nextBoolean()) { in mutateSet() 735 int element = min + rnd.nextInt(rangeSize); in mutateSet() 747 remove(set, min - 5 + rnd.nextInt(rangeSize + 10)); in mutateSubSet() 752 if (rnd.nextBoolean()) { in mutateSubSet() 760 int element = min - 5 + rnd.nextInt(rangeSize + 10); in mutateSubSet() 797 boolean incl = rnd.nextBoolean(); in bashSubSet() 800 if (rnd.nextBoolean()) in bashSubSet() [all …]
|
D | ConcurrentSkipListSetTest.java | 663 Random rnd = new Random(666); field in ConcurrentSkipListSetTest 707 int element = rnd.nextInt(limit); in populate() 718 remove(set, min - 5 + rnd.nextInt(rangeSize + 10), bs); in mutateSet() 723 if (rnd.nextBoolean()) { in mutateSet() 731 int element = min + rnd.nextInt(rangeSize); in mutateSet() 744 remove(set, min - 5 + rnd.nextInt(rangeSize + 10), bs); in mutateSubSet() 749 if (rnd.nextBoolean()) { in mutateSubSet() 757 int element = min - 5 + rnd.nextInt(rangeSize + 10); in mutateSubSet() 795 boolean incl = rnd.nextBoolean(); in bashSubSet() 798 if (rnd.nextBoolean()) in bashSubSet() [all …]
|
D | TreeMapTest.java | 784 Random rnd = new Random(666); 818 int key = rnd.nextInt(limit); 829 remove(map, min - 5 + rnd.nextInt(rangeSize + 10)); 834 if (rnd.nextBoolean()) { 842 int key = min + rnd.nextInt(rangeSize); 854 remove(map, min - 5 + rnd.nextInt(rangeSize + 10)); 859 if (rnd.nextBoolean()) { 867 int key = min - 5 + rnd.nextInt(rangeSize + 10); 904 boolean incl = rnd.nextBoolean(); 907 if (rnd.nextBoolean()) [all …]
|
D | ConcurrentSkipListMapTest.java | 979 Random rnd = new Random(666); 1013 int key = rnd.nextInt(limit); 1024 remove(map, min - 5 + rnd.nextInt(rangeSize + 10)); 1029 if (rnd.nextBoolean()) { 1037 int key = min + rnd.nextInt(rangeSize); 1049 remove(map, min - 5 + rnd.nextInt(rangeSize + 10)); 1054 if (rnd.nextBoolean()) { 1062 int key = min - 5 + rnd.nextInt(rangeSize + 10); 1099 boolean incl = rnd.nextBoolean(); 1102 if (rnd.nextBoolean()) [all …]
|
D | RecursiveActionTest.java | 1240 ThreadLocalRandom rnd = ThreadLocalRandom.current(); in testSortTaskDemo() local 1243 array[i] = rnd.nextLong(); in testSortTaskDemo()
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
D | BigIntegerConstructorsTest.java | 743 Random rnd = new Random(); in testConstructorRandom() local 744 BigInteger aNumber = new BigInteger(bitLen, rnd); in testConstructorRandom() 750 Random rnd = new Random(); in testConstructorPrime() local 756 b = new BigInteger(bits, 10, rnd); in testConstructorPrime() 761 b = new BigInteger(bits, 10, rnd); in testConstructorPrime() 766 b = new BigInteger(bits, 10, rnd); in testConstructorPrime() 772 b = new BigInteger(bits, 10, rnd); in testConstructorPrime() 777 b = new BigInteger(bits, rnd); in testConstructorPrime() 782 b = new BigInteger(bits, rnd); in testConstructorPrime()
|
/libcore/ojluni/src/main/java/java/util/prefs/ |
D | Base64.java | 242 java.util.Random rnd = new java.util.Random(); in main() local 247 arr[k] = (byte)rnd.nextInt(); in main()
|
/libcore/ojluni/src/main/java/java/util/ |
D | Random.java | 229 for (int rnd = nextInt(), in nextBytes() 231 n-- > 0; rnd >>= Byte.SIZE) in nextBytes() 232 bytes[i++] = (byte)rnd; in nextBytes()
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
D | ConcurrentSkipListMap.java | 852 int rnd = ThreadLocalRandom.nextSecondarySeed(); in doPut() local 853 if ((rnd & 0x80000001) == 0) { // test highest and lowest bits in doPut() 855 while (((rnd >>>= 1) & 1) != 0) in doPut() 1376 int rnd = ThreadLocalRandom.current().nextInt(); in buildFromSorted() local 1378 if ((rnd & 0x80000001) == 0) { in buildFromSorted() 1381 } while (((rnd >>>= 1) & 1) != 0); in buildFromSorted() 1481 int rnd = ThreadLocalRandom.current().nextInt(); in readObject() local 1483 if ((rnd & 0x80000001) == 0) { in readObject() 1486 } while (((rnd >>>= 1) & 1) != 0); in readObject()
|
/libcore/support/src/test/java/tests/resources/x509/ |
D | default.cnf | 57 RANDFILE = $ENV::HOME/.rnd
|
/libcore/ojluni/annotations/sdk/nullability/java/util/ |
D | Collections.annotated.java | 50 …til.NonNull java.util.List<?> list, @libcore.util.NonNull java.util.Random rnd) { throw new Runtim… in shuffle() argument
|