01: /**
02:    This program demonstrates the use of a heap as a priority queue.
03: */
04: public class HeapTester
05: {
06:    public static void main(String[] args)
07:    {
08:       MinHeap q = new MinHeap();
09:       q.add(new WorkOrder(3, "Shampoo carpets"));
10:       q.add(new WorkOrder(7, "Empty trash"));
11:       q.add(new WorkOrder(8, "Water plants"));
12:       q.add(new WorkOrder(10, "Remove pencil sharpener shavings"));
13:       q.add(new WorkOrder(6, "Replace light bulb"));
14:       q.add(new WorkOrder(1, "Fix broken sink"));
15:       q.add(new WorkOrder(9, "Clean coffee maker"));
16:       q.add(new WorkOrder(2, "Order cleaning supplies"));
17: 
18:       while (q.size() > 0)
19:          System.out.println(q.remove());      
20:    }
21: }