1 /*
2 * Copyright (c) 1999, 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 /*
25 * @test
26 * @bug 4224271
27 * @summary A null Comparator is now specified to indicate natural ordering.
28 */
29
30 import java.util.ArrayList;
31 import java.util.Arrays;
32 import java.util.Collections;
33 import java.util.List;
34
35 public class NullComparator {
36 public static void main(String[] args) throws Exception {
37 List list = new ArrayList(100);
38 for (int i=0; i<100; i++)
39 list.add(new Integer(i));
40 List sorted = new ArrayList(list);
41 Collections.shuffle(list);
42
43 Object[] a = list.toArray();
44 Arrays.sort(a, null);
45 if (!Arrays.asList(a).equals(sorted))
46 throw new Exception("Arrays.sort");
47 a = list.toArray();
48 Arrays.sort(a, 0, 100, null);
49 if (!Arrays.asList(a).equals(sorted))
50 throw new Exception("Arrays.sort(from, to)");
51 if (Arrays.binarySearch(a, new Integer(69)) != 69)
52 throw new Exception("Arrays.binarySearch");
53
54 List tmp = new ArrayList(list);
55 Collections.sort(tmp, null);
56 if (!tmp.equals(sorted))
57 throw new Exception("Collections.sort");
58 if (Collections.binarySearch(tmp, new Integer(69)) != 69)
59 throw new Exception("Collections.binarySearch");
60 if (!Collections.min(list, null).equals(new Integer(0)))
61 throw new Exception("Collections.min");
62 if (!Collections.max(list, null).equals(new Integer(99)))
63 throw new Exception("Collections.max");
64 }
65 }
|
1 /*
2 * Copyright (c) 1999, 2026, 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 /*
25 * @test
26 * @bug 4224271
27 * @summary A null Comparator is now specified to indicate natural ordering.
28 * @library /test/lib
29 */
30
31 import jdk.test.lib.valueclass.VClass;
32 import java.util.ArrayList;
33 import java.util.Arrays;
34 import java.util.Collections;
35 import java.util.List;
36
37 public class NullComparator {
38
39 public static void main(String[] args) throws Exception {
40 List list = new ArrayList(100);
41 for (int i=0; i<100; i++)
42 list.add(new Integer(i));
43 List sorted = new ArrayList(list);
44 Collections.shuffle(list);
45
46 Object[] a = list.toArray();
47 Arrays.sort(a, null);
48 if (!Arrays.asList(a).equals(sorted))
49 throw new Exception("Arrays.sort");
50 a = list.toArray();
51 Arrays.sort(a, 0, 100, null);
52 if (!Arrays.asList(a).equals(sorted))
53 throw new Exception("Arrays.sort(from, to)");
54 if (Arrays.binarySearch(a, new Integer(69)) != 69)
55 throw new Exception("Arrays.binarySearch");
56
57 List tmp = new ArrayList(list);
58 Collections.sort(tmp, null);
59 if (!tmp.equals(sorted))
60 throw new Exception("Collections.sort");
61 if (Collections.binarySearch(tmp, new Integer(69)) != 69)
62 throw new Exception("Collections.binarySearch");
63 if (!Collections.min(list, null).equals(new Integer(0)))
64 throw new Exception("Collections.min");
65 if (!Collections.max(list, null).equals(new Integer(99)))
66 throw new Exception("Collections.max");
67
68 List<VClass> vlist = new ArrayList<>();
69 for (int i = 0; i < 100; i++) vlist.add(new VClass(i, new int[] { i }));
70 Collections.shuffle(vlist);
71 Collections.sort(vlist, null);
72 for (int i = 0; i < 100; i++)
73 if (!vlist.get(i).equals(new VClass(i, new int[] { i }))) throw new Exception("value Collections.sort");
74 if (Collections.binarySearch(vlist, new VClass(69, new int[] { 69 }), null) != 69)
75 throw new Exception("value binarySearch");
76 if (!Collections.min(vlist, null).equals(new VClass(0, new int[] { 0 })))
77 throw new Exception("value min");
78 if (!Collections.max(vlist, null).equals(new VClass(99, new int[] { 99 })))
79 throw new Exception("value max");
80 }
81 }
|