1 |
jsr166 |
1.1 |
/* |
2 |
|
|
* Copyright 2001 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
20 |
|
|
* CA 95054 USA or visit www.sun.com if you need additional information or |
21 |
|
|
* have any questions. |
22 |
|
|
*/ |
23 |
|
|
|
24 |
|
|
/* |
25 |
|
|
* @test |
26 |
|
|
* @bug 4486049 |
27 |
|
|
* @summary min and max methods fail if size changes in between a call to size |
28 |
|
|
* and an attempt to iterate. |
29 |
|
|
* @author Josh Bloch |
30 |
|
|
*/ |
31 |
|
|
|
32 |
|
|
import java.util.*; |
33 |
|
|
|
34 |
|
|
public class MinMax { |
35 |
|
|
public static void main(String[] args) { |
36 |
|
|
Set s = new LyingSet(); |
37 |
|
|
s.add("x"); |
38 |
|
|
if (!Collections.min(s).equals("x")) |
39 |
|
|
throw new RuntimeException("1: " + Collections.min(s)); |
40 |
|
|
if (!Collections.max(s).equals("x")) |
41 |
|
|
throw new RuntimeException("2: " + Collections.max(s)); |
42 |
|
|
|
43 |
|
|
s.add("y"); |
44 |
|
|
if (!Collections.min(s).equals("x")) |
45 |
|
|
throw new RuntimeException("3: " + Collections.min(s)); |
46 |
|
|
if (!Collections.max(s).equals("y")) |
47 |
|
|
throw new RuntimeException("4: " + Collections.max(s)); |
48 |
|
|
|
49 |
|
|
s.add("w"); |
50 |
|
|
if (!Collections.min(s).equals("w")) |
51 |
|
|
throw new RuntimeException("5: " + Collections.min(s)); |
52 |
|
|
if (!Collections.max(s).equals("y")) |
53 |
|
|
throw new RuntimeException("6: " + Collections.max(s)); |
54 |
|
|
|
55 |
|
|
s.clear(); |
56 |
|
|
s.add("x"); |
57 |
|
|
if (!Collections.min(s, Collections.reverseOrder()).equals("x")) |
58 |
|
|
throw new RuntimeException("1a: " + Collections.min(s)); |
59 |
|
|
if (!Collections.max(s, Collections.reverseOrder()).equals("x")) |
60 |
|
|
throw new RuntimeException("2a: " + Collections.max(s)); |
61 |
|
|
|
62 |
|
|
s.add("y"); |
63 |
|
|
if (!Collections.min(s, Collections.reverseOrder()).equals("y")) |
64 |
|
|
throw new RuntimeException("3a: " + Collections.min(s)); |
65 |
|
|
if (!Collections.max(s, Collections.reverseOrder()).equals("x")) |
66 |
|
|
throw new RuntimeException("4a: " + Collections.max(s)); |
67 |
|
|
|
68 |
|
|
s.add("w"); |
69 |
|
|
if (!Collections.min(s, Collections.reverseOrder()).equals("y")) |
70 |
|
|
throw new RuntimeException("5a: " + Collections.min(s)); |
71 |
|
|
if (!Collections.max(s, Collections.reverseOrder()).equals("w")) |
72 |
|
|
throw new RuntimeException("6a: " + Collections.max(s)); |
73 |
|
|
} |
74 |
|
|
} |
75 |
|
|
|
76 |
|
|
class LyingSet extends LinkedHashSet { |
77 |
|
|
public int size() { |
78 |
|
|
return super.size() + 1; // Lies, lies, all lies! |
79 |
|
|
} |
80 |
|
|
} |