util/PriorityQueue/PriorityQueueSort.java

/*
 * @test %I% %E%
 * @bug 4486658
 * @summary Checks that a priority queue returns elements in sorted order across various operations
 */

import java.util.*;

public class PriorityQueueSort {

    static class MyComparator implements Comparator<Integer> { 
        public int compare(Integer x, Integer y) {
            int i = x.intValue();
            int j = y.intValue();
            if (i < j) return -1;
            if (i > j) return 1;
            return 0;
        }
    }

    public static void main(String[] args) {
        int n = 10000;
        if (args.length > 0)
            n = Integer.parseInt(args[0]);
        
        List<Integer> sorted = new ArrayList<Integer>(n);
        for (int i = 0; i < n; i++)
            sorted.add(new Integer(i));
        List<Integer> shuffled = new ArrayList<Integer>(sorted);
        Collections.shuffle(shuffled);

        Queue<Integer> pq = new PriorityQueue<Integer>(n, new MyComparator());
        for (Iterator<Integer> i = shuffled.iterator(); i.hasNext(); )
            pq.add(i.next());

        List<Integer> recons = new ArrayList<Integer>();
        while (!pq.isEmpty())
            recons.add(pq.remove());
        if (!recons.equals(sorted))
            throw new RuntimeException("Sort test failed");

        recons.clear();
        pq = new PriorityQueue<Integer>(shuffled);
        while (!pq.isEmpty())
            recons.add(pq.remove());
        if (!recons.equals(sorted))
            throw new RuntimeException("Sort test failed");

        // Remove all odd elements from queue
        pq = new PriorityQueue<Integer>(shuffled);
        for (Iterator<Integer> i = pq.iterator(); i.hasNext(); )
            if ((i.next().intValue() & 1) == 1)
                i.remove();
        recons.clear();
        while (!pq.isEmpty())
            recons.add(pq.remove());

        for (Iterator<Integer> i = sorted.iterator(); i.hasNext(); )
            if ((i.next().intValue() & 1) == 1)
                i.remove();

        if (!recons.equals(sorted))
            throw new RuntimeException("Iterator remove test failed.");
    }
}

Revision:	1.4
Committed:	Thu Apr 20 17:42:52 2006 UTC (18 years, 2 months ago) by jsr166
Branch:	MAIN
Changes since 1.3:	+2 -4 lines
Log Message:	6394004: (coll) Thread-safety and Performance improvements to PriorityQueue
#	User	Rev	Content
1	dl	1.1	/*
2	jsr166	1.2	* @test %I% %E%
3			* @bug 4486658
4	jsr166	1.3	* @summary Checks that a priority queue returns elements in sorted order across various operations
5	dl	1.1	*/
6
7			import java.util.*;
8
9			public class PriorityQueueSort {
10
11			static class MyComparator implements Comparator<Integer> {
12			public int compare(Integer x, Integer y) {
13	jsr166	1.4	int i = x.intValue();
14			int j = y.intValue();
15	dl	1.1	if (i < j) return -1;
16			if (i > j) return 1;
17			return 0;
18			}
19			}
20
21			public static void main(String[] args) {
22			int n = 10000;
23			if (args.length > 0)
24			n = Integer.parseInt(args[0]);
25
26			List<Integer> sorted = new ArrayList<Integer>(n);
27			for (int i = 0; i < n; i++)
28			sorted.add(new Integer(i));
29			List<Integer> shuffled = new ArrayList<Integer>(sorted);
30			Collections.shuffle(shuffled);
31
32			Queue<Integer> pq = new PriorityQueue<Integer>(n, new MyComparator());
33			for (Iterator<Integer> i = shuffled.iterator(); i.hasNext(); )
34			pq.add(i.next());
35
36			List<Integer> recons = new ArrayList<Integer>();
37			while (!pq.isEmpty())
38			recons.add(pq.remove());
39			if (!recons.equals(sorted))
40			throw new RuntimeException("Sort test failed");
41
42			recons.clear();
43			pq = new PriorityQueue<Integer>(shuffled);
44			while (!pq.isEmpty())
45			recons.add(pq.remove());
46			if (!recons.equals(sorted))
47			throw new RuntimeException("Sort test failed");
48
49			// Remove all odd elements from queue
50			pq = new PriorityQueue<Integer>(shuffled);
51			for (Iterator<Integer> i = pq.iterator(); i.hasNext(); )
52			if ((i.next().intValue() & 1) == 1)
53			i.remove();
54			recons.clear();
55			while (!pq.isEmpty())
56			recons.add(pq.remove());
57
58			for (Iterator<Integer> i = sorted.iterator(); i.hasNext(); )
59			if ((i.next().intValue() & 1) == 1)
60			i.remove();
61
62			if (!recons.equals(sorted))
63			throw new RuntimeException("Iterator remove test failed.");
64			}
65			}
66