jdk6/jdk/test/java/util/Locale/HashCodeTest.java
Kelly O'Hair 86a3c320e4 6755905: Changes for openjdk6 build 04
6628175: NetBeans/OpenJDK projects should support generated sources
6598089: JDK 7: AWT often goes into busy loop when showing dialog
6612531: api/javax_swing/ScrollPaneLayout/index.html#xxxLayoutSize[ScrollPaneLayout2024] throws NPE
6550267: Debugging some NetBeans/OpenJDK project's demo apps does not work
6610014: Allow partial open jdk builds without access to binary plugs
6643627: JMX source code includes incorrect Java code
6652042: NetBeans JConsole project should run tests against JAR built by project
6652053: Rename NetBeans project from j2se to jdk
6653678: NetBeans JDK projects README file should be release-agnostic
6654456: OpenJDK build problem with freetype makefiles
6654903: OpenJDK NetBeans projects should ony run appropriate tests
6658909: A few more SCCS keyword cleanups and whitespace processing
6616089: Whitespace cleanup on all sources

Final b04 state (as defined by the source bundle)

Reviewed-by: darcy
2009-01-30 16:27:33 -08:00

60 lines
2.3 KiB
Java

/*
* Copyright (c) 2007 Sun Microsystems, Inc. All Rights Reserved.
* 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
* CA 95054 USA or visit www.sun.com if you need additional information or
* have any questions.
*/
/*
* @test
* @bug 4944561
* @summary Test hashCode() to have less than 10% of hash code conflicts.
*/
import java.util.*;
public class HashCodeTest {
public static void main(String[] args) {
Locale[] locales = Locale.getAvailableLocales();
int min = Integer.MAX_VALUE;
int max = Integer.MIN_VALUE;
Map map = new HashMap(locales.length);
int conflicts = 0;
for (int i = 0; i < locales.length; i++) {
Locale loc = locales[i];
int hc = loc.hashCode();
min = Math.min(hc, min);
max = Math.max(hc, max);
Integer key = new Integer(hc);
if (map.containsKey(key)) {
conflicts++;
System.out.println("conflict: " + (Locale) map.get(key) + ", " + loc);
} else {
map.put(key, loc);
}
}
System.out.println(locales.length+" locales: conflicts="+conflicts
+", min="+min+", max="+max +", diff="+(max-min));
if (conflicts >= (locales.length / 10)) {
throw new RuntimeException("too many conflicts: " + conflicts
+ " per " + locales.length + " locales");
}
}
}