/*****************************************
 * Instructions
 *  - Replace 'uwuserid' with your uWaterloo User ID
 *  - Select the current calendar term and enter the year
 *  - List students with whom you had discussions and who helped you
 *
 * uWaterloo User ID:  uwuserid @uwaterloo.ca
 * Submitted for ECE 250
 * Department of Electrical and Computer Engineering
 * University of Waterloo
 * Calender Term of Submission:  (Winter|Spring|Fall) 201N
 *
 * By submitting this file, I affirm that
 * I am the author of all modifications to
 * the provided code.
 *
 * The following is a list of uWaterloo User IDs of those students
 * I had discussions with in preparing this project:
 *    -
 *
 * The following is a list of uWaterloo User IDs of those students
 * who helped me with this project (describe their help; e.g., debugging):
 *    -
 *****************************************/

#ifndef BINARY_MIN_HEAP_H
#define BINARY_MIN_HEAP_H

#ifndef nullptr
#define nullptr 0
#endif

#include "ece250.h"
#include "Exception.h"

template <typename Type>
class BinaryMinHeap {
	private:
		// whatever you want...
		// this includes other private functions

	public:
		BinaryMinHeap( int = 10 );
		BinaryMinHeap( BinaryMinHeap const & );
		~BinaryMinHeap();

		BinaryMinHeap &operator=( BinaryMinHeap const & );

		// Accessors

		int size() const;
		int capacity() const;
		bool empty() const;
		bool full() const;
		Type head() const;
		Type retrieve( int ) const;
		bool member( Type const &obj ) const;

		// Mutators

		void push_heap( Type const & );
		Type pop_heap();
		bool remove( Type const &obj );
		void clear();
};

template <typename Type>
BinaryMinHeap<Type>::BinaryMinHeap( int n ) {
}

template <typename Type>
BinaryMinHeap<Type>::BinaryMinHeap( BinaryMinHeap<Type> const &heap ) {
	*this = heap;
}

template <typename Type>
BinaryMinHeap<Type>::~BinaryMinHeap() {
}

template <typename Type>
BinaryMinHeap<Type> &BinaryMinHeap<Type>::operator=( BinaryMinHeap<Type> const &rhs ) {
	return *this;
}

template <typename Type>
int BinaryMinHeap<Type>::size() const {
	return 0;
}

template <typename Type>
int BinaryMinHeap<Type>::capacity() const {
	return 0;
}

template <typename Type>
bool BinaryMinHeap<Type>::empty() const {
	return true;
}

template <typename Type>
bool BinaryMinHeap<Type>::full() const {
	return false;
}

template <typename Type>
Type BinaryMinHeap<Type>::head() const {
	return Type();
}

template <typename Type>
Type BinaryMinHeap<Type>::retrieve( int n ) const {
	return Type();
}

template <typename Type>
bool BinaryMinHeap<Type>::member( Type const &obj ) const {
	return false;
}

template <typename Type>
void BinaryMinHeap<Type>::push_heap( Type const &obj ) {
}

template <typename Type>
Type BinaryMinHeap<Type>::pop_heap() {
	return Type();
}

template <typename Type>
bool BinaryMinHeap<Type>::remove( Type const &obj ) {
	return false;
}

template <typename Type>
void BinaryMinHeap<Type>::clear() {
}

#endif