| 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 4468802 |
| 27 |
|
|
* @summary Submap clear tickled a bug in an optimization suggested by |
| 28 |
|
|
* Prof. William Collins (Lafayette College) |
| 29 |
|
|
* @author Josh Bloch |
| 30 |
|
|
*/ |
| 31 |
|
|
|
| 32 |
|
|
import java.util.*; |
| 33 |
|
|
|
| 34 |
|
|
public class SubMapClear { |
| 35 |
|
|
public static void main(String[] args) { |
| 36 |
|
|
SortedSet treeSet = new TreeSet(); |
| 37 |
|
|
for (int i = 1; i <=10; i++) |
| 38 |
|
|
treeSet.add(new Integer(i)); |
| 39 |
|
|
Set subSet = treeSet.subSet(new Integer(4),new Integer(10)); |
| 40 |
|
|
subSet.clear(); // Used to throw exception |
| 41 |
|
|
|
| 42 |
|
|
int a[] = new int[] {1, 2, 3, 10}; |
| 43 |
|
|
Set s = new TreeSet(); |
| 44 |
|
|
for (int i = 0; i < a.length; i++) |
| 45 |
|
|
s.add(new Integer(a[i])); |
| 46 |
|
|
if (!treeSet.equals(s)) |
| 47 |
|
|
throw new RuntimeException(treeSet.toString()); |
| 48 |
|
|
} |
| 49 |
|
|
} |
