1 |
|
/* |
2 |
< |
* @test |
3 |
< |
* @synopsis Checks that a priority queue returns elements in sorted order across various operations |
2 |
> |
* @test %I% %E% |
3 |
> |
* @bug 4486658 |
4 |
> |
* @summary Checks that a priority queue returns elements in sorted order across various operations |
5 |
> |
*/ |
6 |
> |
|
7 |
> |
/* |
8 |
> |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
9 |
> |
* Expert Group and released to the public domain, as explained at |
10 |
> |
* http://creativecommons.org/licenses/publicdomain |
11 |
|
*/ |
12 |
|
|
13 |
|
import java.util.*; |
14 |
|
|
15 |
|
public class PriorityQueueSort { |
16 |
|
|
17 |
< |
static class MyComparator implements Comparator<Integer> { |
17 |
> |
static class MyComparator implements Comparator<Integer> { |
18 |
|
public int compare(Integer x, Integer y) { |
19 |
< |
int i = ((Integer)x).intValue(); |
20 |
< |
int j = ((Integer)y).intValue(); |
19 |
> |
int i = x.intValue(); |
20 |
> |
int j = y.intValue(); |
21 |
|
if (i < j) return -1; |
22 |
|
if (i > j) return 1; |
23 |
|
return 0; |
28 |
|
int n = 10000; |
29 |
|
if (args.length > 0) |
30 |
|
n = Integer.parseInt(args[0]); |
31 |
< |
|
31 |
> |
|
32 |
|
List<Integer> sorted = new ArrayList<Integer>(n); |
33 |
|
for (int i = 0; i < n; i++) |
34 |
|
sorted.add(new Integer(i)); |