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