Chapter 24 Exercise 6, Introduction to Java Programming, Tenth Edition Y. Daniel LiangY.

24.6 (Generic PriorityQueue using Comparator ) Revise MyPriorityQueue
in Listing 24.9, using a generic parameter for comparing objects. Define a new
constructor with a Comparator as its argument as follows:
PriorityQueue(Comparator<? super E> comparator)

import java.util.Comparator;

public class Exercise06 {

 public static void main(String[] args) {
  Patient patient1 = new Patient("John", 2);
  Patient patient2 = new Patient("Jim", 1);
  Patient patient3 = new Patient("Tim", 5);
  Patient patient4 = new Patient("Cindy", 7);

  MyPriorityQueue<Patient> priorityQueue = new MyPriorityQueue<Patient>(new PatientComparator());
  priorityQueue.enqueue(patient1);
  priorityQueue.enqueue(patient2);
  priorityQueue.enqueue(patient3);
  priorityQueue.enqueue(patient4);

  while (priorityQueue.getSize() > 0)
   System.out.print(priorityQueue.dequeue() + " ");
 }

 static class Patient implements Comparable<Patient> {
  private String name;
  private int priority;

  public Patient(String name, int priority) {
   this.name = name;
   this.priority = priority;
  }

  @Override
  public String toString() {
   return name + "(priority:" + priority + ")";
  }

  public int compareTo(Patient o) {
   return this.priority - o.priority;
  }
 }
    
 static class PatientComparator implements Comparator<Patient> {
  @Override
  public int compare(Patient o1, Patient o2) {
   return o1.priority - o2.priority;
  }
 }

 static class MyPriorityQueue<E> {
  private Heap<E> heap;

  MyPriorityQueue(Comparator<? super E> comparator) {
   heap = new Heap<E>(comparator);
  }
  
  public void enqueue(E newObject) {
   heap.add(newObject);
  }

  public E dequeue() {
   return heap.remove();
  }

  public int getSize() {
   return heap.getSize();
  }
 }

 static class Heap<E> {
  private java.util.ArrayList<E> list = new java.util.ArrayList<E>();
  private Comparator<? super E> comparator;

  /** Create a default heap */
  public Heap(Comparator<? super E> comparator) {
   this.comparator = comparator;
  }

  /** Create a heap from an array of objects */
  public Heap(E[] objects, Comparator<? super E> comparator) {
   this.comparator = comparator;
   for (int i = 0; i < objects.length; i++)
    add(objects[i]);
  }

  /** Add a new object into the heap */
  public void add(E newObject) {
   list.add(newObject); // Append to the heap
   int currentIndex = list.size() - 1; // The index of the last node

   while (currentIndex > 0) {
    int parentIndex = (currentIndex - 1) / 2;
    // Swap if the current object is greater than its parent
    if (comparator.compare(list.get(currentIndex), list.get(parentIndex)) > 0) {
     E temp = list.get(currentIndex);
     list.set(currentIndex, list.get(parentIndex));
     list.set(parentIndex, temp);
    } else
     break; // the tree is a heap now

    currentIndex = parentIndex;
   }
  }

  /** Remove the root from the heap */
  public E remove() {
   if (list.size() == 0)
    return null;

   E removedObject = list.get(0);
   list.set(0, list.get(list.size() - 1));
   list.remove(list.size() - 1);

   int currentIndex = 0;
   while (currentIndex < list.size()) {
    int leftChildIndex = 2 * currentIndex + 1;
    int rightChildIndex = 2 * currentIndex + 2;

    // Find the maximum between two children
    if (leftChildIndex >= list.size())
     break; // The tree is a heap
    int maxIndex = leftChildIndex;
    if (rightChildIndex < list.size()) {
     if (comparator.compare(list.get(maxIndex), list.get(rightChildIndex)) < 0) {
      maxIndex = rightChildIndex;
     }
    }

    // Swap if the current node is less than the maximum
    if (comparator.compare(list.get(currentIndex), list.get(maxIndex)) < 0) {
     E temp = list.get(maxIndex);
     list.set(maxIndex, list.get(currentIndex));
     list.set(currentIndex, temp);
     currentIndex = maxIndex;
    } else
     break; // The tree is a heap
   }

   return removedObject;
  }

  /** Get the number of nodes in the tree */
  public int getSize() {
   return list.size();
  }
 }

}