#include "PriorityPCBQueue.h"

#include <iostream>

using namespace std;

PriorityPCBQueue::PriorityPCBQueue() //default constructor

{ head = nullptr;

tail = nullptr;

}

PriorityPCBQueue::PriorityPCBQueue(const PriorityPCBQueue& aQueue) //copy consturctor

}

PriorityPCBQueue& PriorityPCBQueue::operator= (const PriorityPCBQueue& rightSide) // overload = sign

{ deletePriorityPCBQueue(); //first deletes any queue that might already exist

PriorityPCBNode* temp = rightSide.head; //creates temp Node ptr to move through rightSide queue

head = new PriorityPCBNode(temp->getPriority(), temp->getPCB_ID(), nullptr); //head now points at new Node object

tail = head; //tail now point at same Node object as head

temp = temp->getNext(); //temp ptr points to second node in rightSide or nullptr if there is now second node

while(temp != nullptr) //if temp does not point to nullptr there are more nodes in rightSide

{ tail->setNextNode(new PriorityPCBNode(temp->getPriority(), temp->getPCB_ID(), nullptr)); //sets next of the node tail points to

tail = tail->getNext(); //tail now points at the new node object just created by setNextNode()

temp = temp->getNext(); //temp now point at next node in rightSide or nullptr if end of aQueue

}

return *this;

}

void PriorityPCBQueue::deletePriorityPCBQueue() //delete function

}

PriorityPCBQueue::~PriorityPCBQueue()

{

deletePriorityPCBQueue();

}

void PriorityPCBQueue::add(int thePriority, int thePCB_ID) //mutator function to add node to queue using priority variable to determine

}

int PriorityPCBQueue::remove() //access item in queue and remove it

}

bool PriorityPCBQueue::isEmpty() const //test to see if queue is empty

}

void PriorityPCBQueue::readContents() const

}