| 1 |
jsr166 |
1.1 |
/* |
| 2 |
|
|
* Copyright 1999 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 4224271 |
| 27 |
|
|
* @summary A null Comparator is now specified to indicate natural ordering. |
| 28 |
|
|
*/ |
| 29 |
|
|
|
| 30 |
|
|
import java.util.*; |
| 31 |
|
|
|
| 32 |
|
|
public class NullComparator { |
| 33 |
|
|
public static void main(String[] args) throws Exception { |
| 34 |
|
|
List list = new ArrayList(100); |
| 35 |
|
|
for (int i=0; i<100; i++) |
| 36 |
|
|
list.add(new Integer(i)); |
| 37 |
|
|
List sorted = new ArrayList(list); |
| 38 |
|
|
Collections.shuffle(list); |
| 39 |
|
|
|
| 40 |
|
|
Object a[] = list.toArray(); |
| 41 |
|
|
Arrays.sort(a, null); |
| 42 |
|
|
if (!Arrays.asList(a).equals(sorted)) |
| 43 |
|
|
throw new Exception("Arrays.sort"); |
| 44 |
|
|
a = list.toArray(); |
| 45 |
|
|
Arrays.sort(a, 0, 100, null); |
| 46 |
|
|
if (!Arrays.asList(a).equals(sorted)) |
| 47 |
|
|
throw new Exception("Arrays.sort(from, to)"); |
| 48 |
|
|
if (Arrays.binarySearch(a, new Integer(69)) != 69) |
| 49 |
|
|
throw new Exception("Arrays.binarySearch"); |
| 50 |
|
|
|
| 51 |
|
|
List tmp = new ArrayList(list); |
| 52 |
|
|
Collections.sort(tmp, null); |
| 53 |
|
|
if (!tmp.equals(sorted)) |
| 54 |
|
|
throw new Exception("Collections.sort"); |
| 55 |
|
|
if (Collections.binarySearch(tmp, new Integer(69)) != 69) |
| 56 |
|
|
throw new Exception("Collections.binarySearch"); |
| 57 |
|
|
if (!Collections.min(list, null).equals(new Integer(0))) |
| 58 |
|
|
throw new Exception("Collections.min"); |
| 59 |
|
|
if (!Collections.max(list, null).equals(new Integer(99))) |
| 60 |
|
|
throw new Exception("Collections.max"); |
| 61 |
|
|
} |
| 62 |
|
|
} |
