1 /* 2 * Copyright (c) 2007, 2013, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 24 /* 25 * @test 26 * @bug 6585904 27 * @run testng CheckedIdentityMap 28 * @summary Checked collections with underlying maps with identity comparisons 29 */ 30 31 import java.util.*; 32 import static java.util.Collections.*; 33 34 import static org.testng.Assert.assertEquals; 35 import static org.testng.Assert.assertNotEquals; 36 37 import org.testng.annotations.Test; 38 39 public class CheckedIdentityMap { 40 41 @Test testHashCode()42 public void testHashCode() { 43 Map<Integer, Integer> m1 = checkedMap( 44 new IdentityHashMap<Integer, Integer>(), 45 Integer.class, Integer.class); 46 Map<Integer, Integer> m2 = checkedMap( 47 new IdentityHashMap<Integer, Integer>(), 48 Integer.class, Integer.class); 49 // NB: these are unique instances. Compare vs. Integer.valueOf(1) 50 m1.put(new Integer(1), new Integer(1)); 51 m2.put(new Integer(1), new Integer(1)); 52 53 Map.Entry<Integer, Integer> e1 = m1.entrySet().iterator().next(); 54 Map.Entry<Integer, Integer> e2 = m2.entrySet().iterator().next(); 55 56 assertNotEquals(e1, e2); 57 assertEquals(e1.hashCode(), hashCode(e1)); 58 assertEquals(e2.hashCode(), hashCode(e2)); 59 } 60 hashCode(Map.Entry<?,?> e)61 static int hashCode(Map.Entry<?,?> e) { 62 return (System.identityHashCode(e.getKey()) ^ 63 System.identityHashCode(e.getValue())); 64 } 65 } 66