1 |
jsr166 |
1.1 |
/* |
2 |
jsr166 |
1.2 |
* Copyright (c) 1999, Oracle and/or its affiliates. All rights reserved. |
3 |
jsr166 |
1.1 |
* 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 |
jsr166 |
1.2 |
* 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 |
jsr166 |
1.1 |
*/ |
23 |
|
|
|
24 |
|
|
/* |
25 |
|
|
* @test |
26 |
|
|
* @bug 4216997 |
27 |
|
|
* @summary Cloning a subclass of LinkedList results in an object that isn't |
28 |
|
|
* an instance of the subclass. The same applies to TreeSet and |
29 |
|
|
* TreeMap. |
30 |
|
|
*/ |
31 |
|
|
|
32 |
jsr166 |
1.4 |
import java.util.LinkedList; |
33 |
|
|
import java.util.TreeMap; |
34 |
|
|
import java.util.TreeSet; |
35 |
jsr166 |
1.1 |
|
36 |
|
|
public class Clone { |
37 |
|
|
public static void main(String[] args) { |
38 |
|
|
LinkedList2 l = new LinkedList2(); |
39 |
|
|
LinkedList2 lClone = (LinkedList2) l.clone(); |
40 |
|
|
if (!(l.equals(lClone) && lClone.equals(l))) |
41 |
|
|
throw new RuntimeException("LinkedList.clone() is broken 1."); |
42 |
|
|
l.add("a"); |
43 |
|
|
lClone = (LinkedList2) l.clone(); |
44 |
|
|
if (!(l.equals(lClone) && lClone.equals(l))) |
45 |
|
|
throw new RuntimeException("LinkedList.clone() is broken 2."); |
46 |
|
|
l.add("b"); |
47 |
|
|
lClone = (LinkedList2) l.clone(); |
48 |
|
|
if (!(l.equals(lClone) && lClone.equals(l))) |
49 |
|
|
throw new RuntimeException("LinkedList.clone() is broken 2."); |
50 |
|
|
|
51 |
|
|
|
52 |
|
|
TreeSet2 s = new TreeSet2(); |
53 |
|
|
TreeSet2 sClone = (TreeSet2) s.clone(); |
54 |
|
|
if (!(s.equals(sClone) && sClone.equals(s))) |
55 |
|
|
throw new RuntimeException("TreeSet.clone() is broken."); |
56 |
|
|
s.add("a"); |
57 |
|
|
sClone = (TreeSet2) s.clone(); |
58 |
|
|
if (!(s.equals(sClone) && sClone.equals(s))) |
59 |
|
|
throw new RuntimeException("TreeSet.clone() is broken."); |
60 |
|
|
s.add("b"); |
61 |
|
|
sClone = (TreeSet2) s.clone(); |
62 |
|
|
if (!(s.equals(sClone) && sClone.equals(s))) |
63 |
|
|
throw new RuntimeException("TreeSet.clone() is broken."); |
64 |
|
|
|
65 |
|
|
TreeMap2 m = new TreeMap2(); |
66 |
|
|
TreeMap2 mClone = (TreeMap2) m.clone(); |
67 |
|
|
if (!(m.equals(mClone) && mClone.equals(m))) |
68 |
|
|
throw new RuntimeException("TreeMap.clone() is broken."); |
69 |
|
|
m.put("a", "b"); |
70 |
|
|
mClone = (TreeMap2) m.clone(); |
71 |
|
|
if (!(m.equals(mClone) && mClone.equals(m))) |
72 |
|
|
throw new RuntimeException("TreeMap.clone() is broken."); |
73 |
|
|
m.put("c", "d"); |
74 |
|
|
mClone = (TreeMap2) m.clone(); |
75 |
|
|
if (!(m.equals(mClone) && mClone.equals(m))) |
76 |
|
|
throw new RuntimeException("TreeMap.clone() is broken."); |
77 |
|
|
} |
78 |
|
|
|
79 |
jsr166 |
1.3 |
private static class LinkedList2 extends LinkedList {} |
80 |
|
|
private static class TreeSet2 extends TreeSet {} |
81 |
|
|
private static class TreeMap2 extends TreeMap {} |
82 |
jsr166 |
1.1 |
} |