1 /* 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 3 * 4 * This code is free software; you can redistribute it and/or modify it 5 * under the terms of the GNU General Public License version 2 only, as 6 * published by the Free Software Foundation. 7 * 8 * This code is distributed in the hope that it will be useful, but WITHOUT 9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 11 * version 2 for more details (a copy is included in the LICENSE file that 12 * accompanied this code). 13 * 14 * You should have received a copy of the GNU General Public License version 15 * 2 along with this work; if not, write to the Free Software Foundation, 16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 17 * 18 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 19 * or visit www.oracle.com if you need additional information or have any 20 * questions. 21 */ 22 23 /* 24 * This file is available under and governed by the GNU General Public 25 * License version 2 only, as published by the Free Software Foundation. 26 * However, the following notice accompanied the original version of this 27 * file: 28 * 29 * Written by Doug Lea with assistance from members of JCP JSR-166 30 * Expert Group and released to the public domain, as explained at 31 * http://creativecommons.org/publicdomain/zero/1.0/ 32 */ 33 34 /* 35 * @test 36 * @bug 4949279 6937857 37 * @summary Independent instantiations of Random() have distinct seeds. 38 * @key randomness 39 */ 40 41 import java.util.ArrayList; 42 import java.util.HashSet; 43 import java.util.List; 44 import java.util.Random; 45 46 public class DistinctSeeds { 47 public static void main(String[] args) throws Exception { 48 // Strictly speaking, it is possible for these to randomly fail, 49 // but the probability should be small (approximately 2**-48). 50 if (new Random().nextLong() == new Random().nextLong() || 51 new Random().nextLong() == new Random().nextLong()) 52 throw new RuntimeException("Random() seeds not unique."); 53 54 // Now try generating seeds concurrently 55 class RandomCollector implements Runnable { 56 long[] randoms = new long[1<<17]; 57 public void run() { 58 for (int i = 0; i < randoms.length; i++) 59 randoms[i] = new Random().nextLong(); 60 } 61 } 62 final int threadCount = 2; 63 List<RandomCollector> collectors = new ArrayList<>(); 64 List<Thread> threads = new ArrayList<Thread>(); 65 for (int i = 0; i < threadCount; i++) { 66 RandomCollector r = new RandomCollector(); 67 collectors.add(r); 68 threads.add(new Thread(r)); 69 } 70 for (Thread thread : threads) 71 thread.start(); 72 for (Thread thread : threads) 73 thread.join(); 74 int collisions = 0; 75 HashSet<Long> s = new HashSet<Long>(); 76 for (RandomCollector r : collectors) { 77 for (long x : r.randoms) { 78 if (s.contains(x)) 79 collisions++; 80 s.add(x); 81 } 82 } 83 System.out.printf("collisions=%d%n", collisions); 84 if (collisions > 10) 85 throw new Error("too many collisions"); 86 } 87 }