/* * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions.
*/
/* * This file is available under and governed by the GNU General Public * License version 2 only, as published by the Free Software Foundation. * However, the following notice accompanied the original version of this * file: * * Written by Doug Lea with assistance from members of JCP JSR-166 * Expert Group and released to the public domain, as explained at * http://creativecommons.org/publicdomain/zero/1.0/
*/
/* * @test * @bug 4949279 6937857 * @summary Independent instantiations of Random() have distinct seeds. * @key randomness
*/
publicclass DistinctSeeds { publicstaticvoid main(String[] args) throws Exception { // Strictly speaking, it is possible for these to randomly fail, // but the probability should be small (approximately 2**-48). if (new Random().nextLong() == new Random().nextLong() || new Random().nextLong() == new Random().nextLong()) thrownew RuntimeException("Random() seeds not unique.");
// Now try generating seeds concurrently class RandomCollector implements Runnable { long[] randoms = newlong[1<<17]; publicvoid run() { for (int i = 0; i < randoms.length; i++)
randoms[i] = new Random().nextLong();
}
} finalint threadCount = 2;
List<RandomCollector> collectors = new ArrayList<>();
List<Thread> threads = new ArrayList<>(); for (int i = 0; i < threadCount; i++) {
RandomCollector r = new RandomCollector();
collectors.add(r);
threads.add(newThread(r));
} for (Threadthread : threads) thread.start(); for (Threadthread : threads) thread.join(); int collisions = 0;
HashSet<Long> s = new HashSet<>(); for (RandomCollector r : collectors) { for (long x : r.randoms) { if (s.contains(x))
collisions++;
s.add(x);
}
}
System.out.printf("collisions=%d%n", collisions); if (collisions > 10) thrownew Error("too many collisions");
}
}
Messung V0.5
¤ Dauer der Verarbeitung: 0.14 Sekunden
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.