ADTPQueue.hpp

Go to the documentation of this file.

 
#pragma once
 
#include "ADTVector.hpp"
 
class PQueue {
 public:
  PQueue(CompareFunc compare, DestroyFunc destroyValue, Vector* values);
  ~PQueue();
  int getSize();
  Pointer getMax();
  Pointer getMin();
  void insert(Pointer value);
  void removeMax();
  DestroyFunc setDestroyValue(DestroyFunc destroyValue);
  void remove(Pointer value, CompareFunc compare);
  int find(Pointer value, CompareFunc compare);
 
  Vector* toVector() { return this->vector; };
 
  // Helper functions
  // These are used because the node IDs are 1-based, where as the
  // vector is 0-based.
  Pointer nodeValue(int nodeId);
  void nodeSwap(int nodeId1, int nodeId2);
  void bubbleUp(int nodeId);
  void bubbleDown(int nodeId);
  void naiveHeapify(Vector* values);
 
 private:
  Vector* vector;
  CompareFunc compare;
  DestroyFunc destroyValue;
};