| 1 |
/* |
| 2 |
* Copyright (c) 2001, 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 |
import java.util.HashMap; |
| 25 |
import java.util.Hashtable; |
| 26 |
import java.util.Map; |
| 27 |
import java.util.Set; |
| 28 |
import java.util.TreeMap; |
| 29 |
import java.util.TreeSet; |
| 30 |
|
| 31 |
/** |
| 32 |
* @test |
| 33 |
* @bug 4503672 |
| 34 |
* @summary AbstractMap.equals and AbstractSet.equals are fragile: they |
| 35 |
* throw exceptions when they should return false. |
| 36 |
* @author Josh Bloch |
| 37 |
*/ |
| 38 |
public class Equals { |
| 39 |
public static void main(String[] args) { |
| 40 |
Map m = new HashMap(); |
| 41 |
m.put(null, ""); |
| 42 |
Map h = new Hashtable(); |
| 43 |
h.put("", ""); |
| 44 |
if (m.equals(h)) |
| 45 |
throw new RuntimeException("1"); |
| 46 |
|
| 47 |
Map m1 = new TreeMap(); |
| 48 |
m1.put(new Integer(42), "The Answer"); |
| 49 |
Map m2 = new TreeMap(); |
| 50 |
m2.put("The Answer", new Integer(42)); |
| 51 |
if (m1.equals(m2)) |
| 52 |
throw new RuntimeException("3"); |
| 53 |
|
| 54 |
Set s1 = new TreeSet(); |
| 55 |
s1.add(new Integer(666)); |
| 56 |
Set s2 = new TreeSet(); |
| 57 |
s2.add("Great googly moogly!"); |
| 58 |
if (s1.equals(s2)) |
| 59 |
throw new RuntimeException("2"); |
| 60 |
} |
| 61 |
} |
