util/PriorityQueue/PriorityQueueSort.java

/*
 * @test %I% %E%
 * @bug 4486658
 * @summary Checks that a priority queue returns elements in sorted order across various operations
 *
 * @compile -source 1.5 PriorityQueueSort.java
 * @run main PriorityQueueSort
 */

import java.util.*;

public class PriorityQueueSort {

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